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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:22:03,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:22:03,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:22:04,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:22:04,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:22:04,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:22:04,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:22:04,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:22:04,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:22:04,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:22:04,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:22:04,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:22:04,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:22:04,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:22:04,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:22:04,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:22:04,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:22:04,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:22:04,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:22:04,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:22:04,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:22:04,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:22:04,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:22:04,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:22:04,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:22:04,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:22:04,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:22:04,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:22:04,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:22:04,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:22:04,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:22:04,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:22:04,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:22:04,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:22:04,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:22:04,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:22:04,037 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-02 12:22:04,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:22:04,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:22:04,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:22:04,053 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:22:04,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:22:04,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:22:04,054 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:22:04,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:22:04,054 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:22:04,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:22:04,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:22:04,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:22:04,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:22:04,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:22:04,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:22:04,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:22:04,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:22:04,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:22:04,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:22:04,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:22:04,057 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:22:04,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:22:04,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:22:04,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:22:04,058 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:22:04,059 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:22:04,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:22:04,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:22:04,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:22:04,138 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:22:04,138 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:22:04,139 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-10-02 12:22:04,140 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-02 12:22:04,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:22:04,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:22:04,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:22:04,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:22:04,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:22:04,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,237 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:22:04,237 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:22:04,237 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:22:04,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:22:04,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:22:04,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:22:04,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:22:04,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/1) ... [2018-10-02 12:22:04,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:22:04,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:22:04,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:22:04,265 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:22:04,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (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-02 12:22:04,338 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-02 12:22:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-02 12:22:04,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-02 12:22:04,538 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:22:04,539 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:22:04 BoogieIcfgContainer [2018-10-02 12:22:04,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:22:04,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:22:04,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:22:04,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:22:04,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:22:04" (1/2) ... [2018-10-02 12:22:04,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52319de and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:22:04, skipping insertion in model container [2018-10-02 12:22:04,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:22:04" (2/2) ... [2018-10-02 12:22:04,553 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-02 12:22:04,563 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:22:04,576 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:22:04,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:22:04,633 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:22:04,633 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:22:04,633 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:22:04,634 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:22:04,634 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:22:04,634 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:22:04,634 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:22:04,635 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:22:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-02 12:22:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-02 12:22:04,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:04,670 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-02 12:22:04,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:04,678 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-02 12:22:04,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:04,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:04,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:04,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:04,840 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-02 12:22:04,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:22:04,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 12:22:04,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:22:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:22:04,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:04,862 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-02 12:22:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:05,048 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 12:22:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:22:05,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-02 12:22:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:05,060 INFO L225 Difference]: With dead ends: 9 [2018-10-02 12:22:05,061 INFO L226 Difference]: Without dead ends: 4 [2018-10-02 12:22:05,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:22:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-02 12:22:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-02 12:22:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-02 12:22:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-02 12:22:05,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-02 12:22:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:05,099 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-02 12:22:05,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:22:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-02 12:22:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 12:22:05,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:05,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 12:22:05,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:05,100 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-02 12:22:05,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:05,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:05,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:05,201 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-02 12:22:05,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:05,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:05,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:05,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-02 12:22:05,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:22:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:22:05,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:05,372 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-02 12:22:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:05,480 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-02 12:22:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:22:05,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-02 12:22:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:05,481 INFO L225 Difference]: With dead ends: 6 [2018-10-02 12:22:05,481 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 12:22:05,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:22:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 12:22:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 12:22:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 12:22:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 12:22:05,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 12:22:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:05,485 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 12:22:05,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:22:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 12:22:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 12:22:05,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:05,486 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-02 12:22:05,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:05,486 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-02 12:22:05,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:05,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:05,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:05,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:05,600 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-02 12:22:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:22:05,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:22:05,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:05,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:05,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:05,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-02 12:22:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:22:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:22:05,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:05,747 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-02 12:22:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:06,121 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-02 12:22:06,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:22:06,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-02 12:22:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:06,123 INFO L225 Difference]: With dead ends: 7 [2018-10-02 12:22:06,124 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 12:22:06,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:22:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 12:22:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 12:22:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 12:22:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 12:22:06,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 12:22:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:06,128 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 12:22:06,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:22:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 12:22:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:22:06,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:06,129 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-02 12:22:06,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:06,131 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-02 12:22:06,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:06,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:06,233 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-02 12:22:06,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:06,234 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-02 12:22:06,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:22:06,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 12:22:06,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:06,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:06,429 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-02 12:22:06,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:06,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-02 12:22:06,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:22:06,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:22:06,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:06,451 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-02 12:22:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:06,639 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 12:22:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:22:06,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-02 12:22:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:06,639 INFO L225 Difference]: With dead ends: 8 [2018-10-02 12:22:06,640 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 12:22:06,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:22:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 12:22:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 12:22:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 12:22:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 12:22:06,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 12:22:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:06,644 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 12:22:06,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:22:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 12:22:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 12:22:06,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:06,645 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-02 12:22:06,645 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:06,645 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-02 12:22:06,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:06,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:06,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:06,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:06,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:06,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:06,875 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-02 12:22:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:22:06,905 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:22:06,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:06,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-02 12:22:07,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:22:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:22:07,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:07,304 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-02 12:22:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:07,630 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 12:22:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:22:07,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-02 12:22:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:07,631 INFO L225 Difference]: With dead ends: 9 [2018-10-02 12:22:07,631 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 12:22:07,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime [2018-10-02 12:22:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 12:22:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 12:22:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 12:22:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 12:22:07,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 12:22:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:07,635 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 12:22:07,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:22:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 12:22:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:22:07,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:07,636 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-02 12:22:07,637 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:07,637 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-02 12:22:07,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:07,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:07,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:07,802 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-02 12:22:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:22:07,823 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 12:22:07,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:07,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:07,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-02 12:22:07,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:22:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:22:07,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:07,963 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-02 12:22:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:08,352 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 12:22:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:22:08,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-02 12:22:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:08,353 INFO L225 Difference]: With dead ends: 10 [2018-10-02 12:22:08,353 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 12:22:08,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:22:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 12:22:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 12:22:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 12:22:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 12:22:08,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 12:22:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:08,358 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 12:22:08,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:22:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 12:22:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:22:08,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:08,359 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-02 12:22:08,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:08,359 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-02 12:22:08,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:08,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:08,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:08,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:08,858 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-02 12:22:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:22:08,878 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 12:22:08,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:08,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:09,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:09,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:22:09,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:22:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:22:09,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:09,095 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-02 12:22:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:09,590 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 12:22:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:22:09,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-02 12:22:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:09,591 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:22:09,591 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 12:22:09,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:22:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 12:22:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 12:22:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 12:22:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 12:22:09,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 12:22:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:09,597 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 12:22:09,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:22:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 12:22:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:22:09,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:09,598 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-02 12:22:09,598 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:09,598 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-02 12:22:09,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:09,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:09,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:09,819 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-02 12:22:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:09,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:10,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:10,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-02 12:22:10,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:22:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:22:10,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:10,112 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-02 12:22:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:10,539 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 12:22:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:22:10,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-02 12:22:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:10,541 INFO L225 Difference]: With dead ends: 12 [2018-10-02 12:22:10,541 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 12:22:10,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:22:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 12:22:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 12:22:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 12:22:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 12:22:10,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 12:22:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:10,547 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 12:22:10,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:22:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 12:22:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:22:10,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:10,548 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-02 12:22:10,548 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:10,548 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-02 12:22:10,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:10,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:10,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:10,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:22:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:22:10,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:22:10,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:10,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:11,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:11,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-02 12:22:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:22:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:22:11,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:11,122 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-02 12:22:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:11,722 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 12:22:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:22:11,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-02 12:22:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:11,723 INFO L225 Difference]: With dead ends: 13 [2018-10-02 12:22:11,724 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 12:22:11,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime [2018-10-02 12:22:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 12:22:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 12:22:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 12:22:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 12:22:11,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 12:22:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:11,729 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 12:22:11,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:22:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 12:22:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:22:11,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:11,730 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-02 12:22:11,730 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:11,730 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-02 12:22:11,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:11,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:11,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:11,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:11,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:11,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:11,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:22:12,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:22:12,053 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-02 12:22:12,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:12,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:12,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 12:22:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 12:22:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 12:22:12,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:12,365 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-02 12:22:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:12,993 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 12:22:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:22:12,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-02 12:22:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:12,994 INFO L225 Difference]: With dead ends: 14 [2018-10-02 12:22:12,994 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 12:22:12,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime [2018-10-02 12:22:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 12:22:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 12:22:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 12:22:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 12:22:12,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-02 12:22:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:12,998 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 12:22:12,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 12:22:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 12:22:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:22:12,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:12,999 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-02 12:22:12,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:12,999 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:13,000 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-02 12:22:13,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:13,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:13,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:13,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:13,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:13,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:13,392 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-02 12:22:13,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:22:13,410 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:22:13,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:13,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:14,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:14,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-02 12:22:14,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 12:22:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 12:22:14,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:14,284 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-02 12:22:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:15,155 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 12:22:15,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:22:15,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-02 12:22:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:15,156 INFO L225 Difference]: With dead ends: 15 [2018-10-02 12:22:15,156 INFO L226 Difference]: Without dead ends: 14 [2018-10-02 12:22:15,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime [2018-10-02 12:22:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-02 12:22:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-02 12:22:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-02 12:22:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-02 12:22:15,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-02 12:22:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:15,161 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-02 12:22:15,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 12:22:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-02 12:22:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:22:15,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:15,162 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-02 12:22:15,162 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:15,163 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-02 12:22:15,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:15,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:15,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:15,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:15,439 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-02 12:22:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:22:15,480 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-02 12:22:15,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:15,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:15,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-02 12:22:15,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 12:22:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 12:22:16,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:16,000 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-02 12:22:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:17,038 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-02 12:22:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:22:17,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-02 12:22:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:17,039 INFO L225 Difference]: With dead ends: 16 [2018-10-02 12:22:17,039 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 12:22:17,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:22:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 12:22:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 12:22:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 12:22:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 12:22:17,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-02 12:22:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:17,044 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-02 12:22:17,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 12:22:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 12:22:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:22:17,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:17,045 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-02 12:22:17,045 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:17,046 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-02 12:22:17,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:17,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:17,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:17,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:17,630 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-02 12:22:17,638 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:22:17,653 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 12:22:17,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:17,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-02 12:22:18,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 12:22:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 12:22:18,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:18,076 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-02 12:22:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:19,152 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-02 12:22:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:22:19,152 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-02 12:22:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:19,153 INFO L225 Difference]: With dead ends: 17 [2018-10-02 12:22:19,154 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 12:22:19,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:22:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 12:22:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 12:22:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 12:22:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-02 12:22:19,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-02 12:22:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:19,160 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-02 12:22:19,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 12:22:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-02 12:22:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:22:19,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:19,161 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-02 12:22:19,161 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:19,162 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-02 12:22:19,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:19,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:19,595 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-02 12:22:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:19,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:20,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:20,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-02 12:22:20,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 12:22:20,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 12:22:20,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:20,464 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-02 12:22:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:21,790 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-02 12:22:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:22:21,791 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-02 12:22:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:21,791 INFO L225 Difference]: With dead ends: 18 [2018-10-02 12:22:21,792 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 12:22:21,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime [2018-10-02 12:22:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 12:22:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 12:22:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 12:22:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 12:22:21,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-02 12:22:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:21,798 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 12:22:21,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 12:22:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 12:22:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:22:21,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:21,799 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-02 12:22:21,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:21,799 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-02 12:22:21,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:22,267 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-02 12:22:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:22:22,295 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:22:22,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:22,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:23,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:23,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-02 12:22:23,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 12:22:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 12:22:23,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:23,204 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-02 12:22:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:25,051 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 12:22:25,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:22:25,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-02 12:22:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:25,052 INFO L225 Difference]: With dead ends: 19 [2018-10-02 12:22:25,053 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 12:22:25,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime [2018-10-02 12:22:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 12:22:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-02 12:22:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-02 12:22:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-02 12:22:25,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-02 12:22:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:25,058 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-02 12:22:25,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 12:22:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-02 12:22:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:22:25,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:25,059 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-02 12:22:25,059 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:25,059 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-02 12:22:25,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:25,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:25,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:25,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:25,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:25,613 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-02 12:22:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:22:25,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-02 12:22:25,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:25,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:26,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:26,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-02 12:22:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 12:22:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 12:22:26,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:26,265 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-02 12:22:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:27,843 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-02 12:22:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:22:27,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-02 12:22:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:27,844 INFO L225 Difference]: With dead ends: 20 [2018-10-02 12:22:27,844 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 12:22:27,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime [2018-10-02 12:22:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 12:22:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 12:22:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 12:22:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 12:22:27,849 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-02 12:22:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:27,850 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-02 12:22:27,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 12:22:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 12:22:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:22:27,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:27,851 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-02 12:22:27,851 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:27,851 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-02 12:22:27,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:27,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:28,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:28,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:22:28,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:22:28,602 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:22:28,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:28,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:29,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:29,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-02 12:22:29,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 12:22:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 12:22:29,197 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:29,197 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-02 12:22:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:30,996 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 12:22:30,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:22:30,996 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-02 12:22:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:30,997 INFO L225 Difference]: With dead ends: 21 [2018-10-02 12:22:30,997 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 12:22:30,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime [2018-10-02 12:22:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 12:22:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 12:22:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 12:22:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-02 12:22:31,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-02 12:22:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:31,004 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-02 12:22:31,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 12:22:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-02 12:22:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 12:22:31,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:31,005 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-02 12:22:31,005 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:31,005 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-02 12:22:31,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:31,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:31,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:31,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:31,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:31,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:31,595 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-02 12:22:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:22:31,626 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-02 12:22:31,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:31,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:32,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:32,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-02 12:22:32,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 12:22:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 12:22:32,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:32,930 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-02 12:22:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:35,636 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-02 12:22:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:22:35,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-02 12:22:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:35,638 INFO L225 Difference]: With dead ends: 22 [2018-10-02 12:22:35,638 INFO L226 Difference]: Without dead ends: 21 [2018-10-02 12:22:35,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime [2018-10-02 12:22:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-02 12:22:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-02 12:22:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 12:22:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 12:22:35,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-02 12:22:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:35,643 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 12:22:35,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 12:22:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 12:22:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:22:35,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:35,644 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-02 12:22:35,644 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:35,644 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-02 12:22:35,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:35,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:35,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:36,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:36,969 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-02 12:22:36,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:22:37,005 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-02 12:22:37,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:37,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:38,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-02 12:22:38,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 12:22:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 12:22:38,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:38,706 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-02 12:22:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:41,701 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 12:22:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:22:41,702 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-02 12:22:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:41,702 INFO L225 Difference]: With dead ends: 23 [2018-10-02 12:22:41,703 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 12:22:41,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.5s impTime [2018-10-02 12:22:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 12:22:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 12:22:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 12:22:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-02 12:22:41,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-02 12:22:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:41,707 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-02 12:22:41,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 12:22:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-02 12:22:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:22:41,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:41,708 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-02 12:22:41,708 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:41,708 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-02 12:22:41,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:41,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:41,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:42,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:42,485 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:22:42,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:42,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:43,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:43,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-02 12:22:43,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 12:22:43,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 12:22:43,591 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:43,591 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-02 12:22:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:46,673 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-02 12:22:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:22:46,673 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-02 12:22:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:46,674 INFO L225 Difference]: With dead ends: 24 [2018-10-02 12:22:46,674 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 12:22:46,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime [2018-10-02 12:22:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 12:22:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 12:22:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 12:22:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 12:22:46,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-02 12:22:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-02 12:22:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 12:22:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 12:22:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:22:46,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:46,684 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-02 12:22:46,684 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:46,684 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-02 12:22:46,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:46,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:22:46,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:47,589 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-02 12:22:47,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:47,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:22:47,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:22:47,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:22:47,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:47,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:48,678 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-02 12:22:48,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:48,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-02 12:22:48,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 12:22:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 12:22:48,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:48,701 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-02 12:22:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:51,593 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-02 12:22:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:22:51,594 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-02 12:22:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:51,595 INFO L225 Difference]: With dead ends: 25 [2018-10-02 12:22:51,595 INFO L226 Difference]: Without dead ends: 24 [2018-10-02 12:22:51,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.6s impTime [2018-10-02 12:22:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-02 12:22:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-02 12:22:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 12:22:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-02 12:22:51,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-02 12:22:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:51,600 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-02 12:22:51,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 12:22:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-02 12:22:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 12:22:51,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:51,601 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-02 12:22:51,601 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:51,601 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-02 12:22:51,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:51,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:52,698 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-02 12:22:52,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:22:52,734 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-02 12:22:52,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:52,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:22:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:54,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:22:54,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-02 12:22:54,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 12:22:54,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 12:22:54,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:22:54,099 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-02 12:22:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:22:57,967 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-02 12:22:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:22:57,971 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-02 12:22:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:22:57,971 INFO L225 Difference]: With dead ends: 26 [2018-10-02 12:22:57,971 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 12:22:57,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 2.0s impTime [2018-10-02 12:22:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 12:22:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-02 12:22:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 12:22:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 12:22:57,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-02 12:22:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:22:57,976 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 12:22:57,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 12:22:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 12:22:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:22:57,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:22:57,977 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-02 12:22:57,978 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:22:57,978 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:22:57,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-02 12:22:57,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:22:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:22:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:57,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:22:57,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:22:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:22:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:22:59,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:22:59,010 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-02 12:22:59,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:22:59,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:22:59,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:22:59,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:00,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:00,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-02 12:23:00,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 12:23:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 12:23:00,422 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:00,422 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-02 12:23:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:04,145 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 12:23:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:23:04,146 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-02 12:23:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:04,146 INFO L225 Difference]: With dead ends: 27 [2018-10-02 12:23:04,146 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 12:23:04,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 2.0s impTime [2018-10-02 12:23:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 12:23:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 12:23:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 12:23:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-02 12:23:04,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-02 12:23:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:04,152 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-02 12:23:04,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 12:23:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-02 12:23:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:23:04,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:04,153 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-02 12:23:04,153 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:04,153 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-02 12:23:04,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:04,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:04,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:06,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:06,045 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:23:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:23:06,087 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-02 12:23:06,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:23:06,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-02 12:23:08,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 12:23:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 12:23:08,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:08,352 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-02 12:23:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:12,167 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-02 12:23:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 12:23:12,168 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-02 12:23:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:12,168 INFO L225 Difference]: With dead ends: 28 [2018-10-02 12:23:12,169 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 12:23:12,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 3.4s impTime [2018-10-02 12:23:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 12:23:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 12:23:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 12:23:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 12:23:12,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-02 12:23:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:12,173 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 12:23:12,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 12:23:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 12:23:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:23:12,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:12,174 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-02 12:23:12,175 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:12,175 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-02 12:23:12,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:12,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:12,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:13,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:13,500 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-02 12:23:13,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:23:13,566 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 12:23:13,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:23:13,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-02 12:23:15,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 12:23:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 12:23:15,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:15,852 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-02 12:23:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:20,240 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-02 12:23:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:23:20,240 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-02 12:23:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:20,241 INFO L225 Difference]: With dead ends: 29 [2018-10-02 12:23:20,241 INFO L226 Difference]: Without dead ends: 28 [2018-10-02 12:23:20,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 3.1s impTime [2018-10-02 12:23:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-02 12:23:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-02 12:23:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-02 12:23:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-02 12:23:20,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-02 12:23:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:20,248 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-02 12:23:20,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 12:23:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-02 12:23:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-02 12:23:20,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:20,249 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-02 12:23:20,249 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:20,249 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-02 12:23:20,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:20,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:20,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:21,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:21,786 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-02 12:23:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:23:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:21,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:24,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:24,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-02 12:23:24,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 12:23:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 12:23:24,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:24,174 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-02 12:23:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:29,006 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-02 12:23:29,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:23:29,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-02 12:23:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:29,007 INFO L225 Difference]: With dead ends: 30 [2018-10-02 12:23:29,007 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 12:23:29,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 3.2s impTime [2018-10-02 12:23:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 12:23:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-02 12:23:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 12:23:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 12:23:29,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-02 12:23:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:29,013 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 12:23:29,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 12:23:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 12:23:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 12:23:29,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:29,014 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-02 12:23:29,014 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:29,015 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-02 12:23:29,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:29,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:29,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:23:29,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:30,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:30,591 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-02 12:23:30,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:23:30,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:23:30,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:23:30,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:32,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:32,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-02 12:23:32,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 12:23:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 12:23:32,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:32,648 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-02 12:23:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:38,399 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 12:23:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:23:38,399 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-02 12:23:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:38,400 INFO L225 Difference]: With dead ends: 31 [2018-10-02 12:23:38,400 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 12:23:38,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 3.1s impTime [2018-10-02 12:23:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 12:23:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-02 12:23:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 12:23:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-02 12:23:38,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-02 12:23:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:38,405 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-02 12:23:38,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 12:23:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-02 12:23:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:23:38,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:38,406 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-02 12:23:38,406 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:38,406 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-02 12:23:38,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:38,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:40,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:40,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 12:23:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:23:40,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-02 12:23:40,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:23:40,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:42,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:42,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-02 12:23:42,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 12:23:42,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 12:23:42,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:42,647 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-02 12:23:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:49,698 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-02 12:23:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:23:49,698 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-02 12:23:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:49,699 INFO L225 Difference]: With dead ends: 32 [2018-10-02 12:23:49,699 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 12:23:49,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 3.6s impTime [2018-10-02 12:23:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 12:23:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 12:23:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 12:23:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 12:23:49,705 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-02 12:23:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:49,705 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-02 12:23:49,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-02 12:23:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 12:23:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:23:49,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:49,706 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-02 12:23:49,706 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:49,707 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-02 12:23:49,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:49,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:23:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:23:51,566 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-02 12:23:51,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:23:51,610 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:23:51,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:23:51,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:23:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:23:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:23:53,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-02 12:23:53,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-02 12:23:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-02 12:23:53,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:23:53,860 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-02 12:23:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:23:59,640 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-02 12:23:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:23:59,641 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-02 12:23:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:23:59,641 INFO L225 Difference]: With dead ends: 33 [2018-10-02 12:23:59,641 INFO L226 Difference]: Without dead ends: 32 [2018-10-02 12:23:59,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.5s impTime [2018-10-02 12:23:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-02 12:23:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-02 12:23:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-02 12:23:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-02 12:23:59,648 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-02 12:23:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:23:59,648 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-02 12:23:59,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-02 12:23:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-02 12:23:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 12:23:59,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:23:59,649 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-02 12:23:59,649 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:23:59,650 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:23:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-02 12:23:59,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:23:59,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:23:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:59,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:23:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:23:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:02,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:24:02,156 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-02 12:24:02,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:24:02,220 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-02 12:24:02,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:24:02,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:24:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:04,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:24:04,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-02 12:24:04,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-02 12:24:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-02 12:24:04,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:24:04,999 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-02 12:24:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:24:12,040 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-02 12:24:12,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:24:12,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-02 12:24:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:24:12,041 INFO L225 Difference]: With dead ends: 34 [2018-10-02 12:24:12,042 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 12:24:12,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time 4.6s impTime [2018-10-02 12:24:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 12:24:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 12:24:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 12:24:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 12:24:12,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-02 12:24:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:24:12,048 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 12:24:12,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-02 12:24:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 12:24:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 12:24:12,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:24:12,049 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-02 12:24:12,049 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:24:12,049 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:24:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-02 12:24:12,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:24:12,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:24:12,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:12,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:24:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:14,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:24:14,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:24:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:24:14,389 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-02 12:24:14,389 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:24:14,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:24:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:17,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:24:17,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-02 12:24:17,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-02 12:24:17,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-02 12:24:17,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:24:17,597 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-02 12:24:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:24:27,163 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 12:24:27,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 12:24:27,164 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-02 12:24:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:24:27,164 INFO L225 Difference]: With dead ends: 35 [2018-10-02 12:24:27,164 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 12:24:27,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s Time 4.8s impTime [2018-10-02 12:24:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 12:24:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 12:24:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 12:24:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-02 12:24:27,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-02 12:24:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:24:27,169 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-02 12:24:27,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-02 12:24:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-02 12:24:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 12:24:27,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:24:27,170 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-02 12:24:27,170 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:24:27,170 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:24:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-02 12:24:27,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:24:27,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:24:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:27,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:24:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:29,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:24:29,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:24:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:24:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:29,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:24:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:24:33,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-02 12:24:33,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-02 12:24:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-02 12:24:33,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:24:33,259 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-02 12:24:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:24:41,381 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-02 12:24:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:24:41,381 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-02 12:24:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:24:41,382 INFO L225 Difference]: With dead ends: 36 [2018-10-02 12:24:41,382 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 12:24:41,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s Time 5.2s impTime [2018-10-02 12:24:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 12:24:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 12:24:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:24:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 12:24:41,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-02 12:24:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:24:41,388 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-02 12:24:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-02 12:24:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 12:24:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:24:41,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:24:41,389 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-02 12:24:41,389 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:24:41,389 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:24:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-02 12:24:41,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:24:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:24:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:24:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:44,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:24:44,018 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:24:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:24:44,070 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:24:44,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:24:44,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:24:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:47,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:24:47,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-02 12:24:47,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-02 12:24:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-02 12:24:47,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:24:47,490 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-02 12:24:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:24:56,649 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-02 12:24:56,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 12:24:56,650 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-02 12:24:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:24:56,650 INFO L225 Difference]: With dead ends: 37 [2018-10-02 12:24:56,650 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 12:24:56,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s Time 5.4s impTime [2018-10-02 12:24:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 12:24:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 12:24:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 12:24:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-02 12:24:56,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-02 12:24:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:24:56,657 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-02 12:24:56,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-02 12:24:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-02 12:24:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 12:24:56,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:24:56,658 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-02 12:24:56,658 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:24:56,658 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:24:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-02 12:24:56,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:24:56,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:24:56,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:56,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:24:56,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:24:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:24:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:24:59,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:24:59,627 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:24:59,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:24:59,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-02 12:24:59,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:24:59,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:25:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:03,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:25:03,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-02 12:25:03,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-02 12:25:03,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-02 12:25:03,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:25:03,603 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-02 12:25:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:25:14,451 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-02 12:25:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 12:25:14,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-02 12:25:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:25:14,452 INFO L225 Difference]: With dead ends: 38 [2018-10-02 12:25:14,452 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 12:25:14,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time 6.1s impTime [2018-10-02 12:25:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 12:25:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 12:25:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 12:25:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 12:25:14,458 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-02 12:25:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:25:14,458 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 12:25:14,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-02 12:25:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 12:25:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 12:25:14,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:25:14,459 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-02 12:25:14,459 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:25:14,459 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:25:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-02 12:25:14,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:25:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:25:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:14,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:25:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:25:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:17,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:25:17,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:25:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:25:17,703 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:25:17,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:25:17,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:25:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:25:21,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-02 12:25:21,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-02 12:25:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-02 12:25:21,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:25:21,847 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-02 12:25:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:25:32,335 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 12:25:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 12:25:32,335 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-02 12:25:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:25:32,336 INFO L225 Difference]: With dead ends: 39 [2018-10-02 12:25:32,336 INFO L226 Difference]: Without dead ends: 38 [2018-10-02 12:25:32,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s Time 6.5s impTime [2018-10-02 12:25:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-02 12:25:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-02 12:25:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 12:25:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-02 12:25:32,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-02 12:25:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:25:32,341 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-02 12:25:32,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-02 12:25:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-02 12:25:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 12:25:32,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:25:32,341 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-02 12:25:32,341 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:25:32,341 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:25:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-02 12:25:32,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:25:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:25:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:32,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:25:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:25:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:35,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:25:35,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:25:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:25:35,901 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-02 12:25:35,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:25:35,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:25:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:40,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:25:40,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-02 12:25:40,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-02 12:25:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-02 12:25:40,078 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:25:40,078 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-02 12:25:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:25:50,677 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-02 12:25:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 12:25:50,677 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-02 12:25:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:25:50,678 INFO L225 Difference]: With dead ends: 40 [2018-10-02 12:25:50,678 INFO L226 Difference]: Without dead ends: 39 [2018-10-02 12:25:50,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s Time 6.8s impTime [2018-10-02 12:25:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-02 12:25:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-02 12:25:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-02 12:25:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-02 12:25:50,684 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-02 12:25:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:25:50,684 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-02 12:25:50,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-02 12:25:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-02 12:25:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 12:25:50,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:25:50,685 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-02 12:25:50,685 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:25:50,685 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:25:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-02 12:25:50,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:25:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:25:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:50,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:25:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:25:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:25:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:54,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:25:54,354 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:25:54,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:25:54,425 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 12:25:54,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:25:54,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:25:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:25:58,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:25:58,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-02 12:25:58,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-02 12:25:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-02 12:25:58,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:25:58,858 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-02 12:26:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:26:10,238 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-02 12:26:10,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:26:10,238 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-02 12:26:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:26:10,239 INFO L225 Difference]: With dead ends: 41 [2018-10-02 12:26:10,239 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 12:26:10,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s Time 7.3s impTime [2018-10-02 12:26:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 12:26:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 12:26:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 12:26:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-02 12:26:10,244 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-02 12:26:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:26:10,244 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-02 12:26:10,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-02 12:26:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-02 12:26:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:26:10,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:26:10,245 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-02 12:26:10,245 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:26:10,245 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:26:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-02 12:26:10,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:26:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:26:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:26:10,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:26:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:26:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:26:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:26:14,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:26:14,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:26:14,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:26:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:26:14,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:26:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:26:18,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:26:18,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-02 12:26:18,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-02 12:26:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-02 12:26:18,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:26:18,980 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. Received shutdown request... [2018-10-02 12:26:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:26:28,710 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:26:28,714 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:26:28,715 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:26:28 BoogieIcfgContainer [2018-10-02 12:26:28,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:26:28,715 INFO L168 Benchmark]: Toolchain (without parser) took 264523.57 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 12.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 270.2 MB). Peak memory consumption was 282.8 MB. Max. memory is 7.1 GB. [2018-10-02 12:26:28,717 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:26:28,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:26:28,718 INFO L168 Benchmark]: Boogie Preprocessor took 23.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:26:28,718 INFO L168 Benchmark]: RCFGBuilder took 274.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:26:28,719 INFO L168 Benchmark]: TraceAbstraction took 264174.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 12.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 249.1 MB). Peak memory consumption was 261.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:26:28,723 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 274.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264174.31 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 12.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 249.1 MB). Peak memory consumption was 261.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (40states) and FLOYD_HOARE automaton (currently 34 states, 77 states before enhancement), while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 264.0s OverallTime, 38 OverallIterations, 37 TraceHistogramMax, 151.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 22539 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1481 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 109.1s InterpolantComputationTime, 1556 NumberOfCodeBlocks, 1556 NumberOfCodeBlocksAsserted, 264 NumberOfCheckSat, 1481 ConstructedInterpolants, 0 QuantifiedInterpolants, 367043 SizeOfPredicates, 37 NumberOfNonLiveVariables, 3071 ConjunctsInSsa, 1517 ConjunctsInUnsatCore, 75 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-26-28-734.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-26-28-734.csv Completed graceful shutdown