java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:30:11,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:30:11,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:30:11,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:30:11,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:30:11,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:30:11,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:30:11,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:30:11,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:30:11,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:30:11,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:30:11,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:30:11,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:30:11,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:30:11,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:30:11,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:30:11,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:30:11,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:30:11,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:30:11,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:30:11,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:30:11,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:30:11,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:30:11,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:30:11,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:30:11,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:30:11,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:30:11,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:30:11,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:30:11,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:30:11,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:30:11,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:30:11,789 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:30:11,789 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:30:11,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:30:11,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:30:11,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:30:11,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:30:11,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:30:11,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:30:11,818 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:30:11,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:30:11,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:30:11,819 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:30:11,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:30:11,819 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:30:11,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:30:11,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:30:11,821 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:30:11,821 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:30:11,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:30:11,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:30:11,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:30:11,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:30:11,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:30:11,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:30:11,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:30:11,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:30:11,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:30:11,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:30:11,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:30:11,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:30:11,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:30:11,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:30:11,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:30:11,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:30:11,892 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:30:11,893 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-04 09:30:11,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-04 09:30:11,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:30:11,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:30:11,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:30:11,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:30:11,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:30:11,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:11,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:11,990 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:30:11,990 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:30:11,990 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:30:11,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:30:11,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:30:11,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:30:11,994 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:30:12,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... [2018-10-04 09:30:12,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:30:12,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:30:12,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:30:12,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:30:12,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:30:12,095 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 09:30:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 09:30:12,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 09:30:12,245 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:30:12,246 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:30:12 BoogieIcfgContainer [2018-10-04 09:30:12,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:30:12,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:30:12,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:30:12,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:30:12,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:30:11" (1/2) ... [2018-10-04 09:30:12,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad2e6cd and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:30:12, skipping insertion in model container [2018-10-04 09:30:12,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:30:12" (2/2) ... [2018-10-04 09:30:12,254 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-04 09:30:12,264 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:30:12,272 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:30:12,323 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:30:12,324 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:30:12,325 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:30:12,325 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:30:12,325 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:30:12,325 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:30:12,325 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:30:12,326 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:30:12,326 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:30:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 09:30:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 09:30:12,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:12,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 09:30:12,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:12,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 09:30:12,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:12,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:12,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:12,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:30:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:30:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 09:30:12,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:30:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:30:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:30:12,535 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 09:30:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:12,585 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:30:12,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:30:12,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 09:30:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:12,598 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:30:12,599 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 09:30:12,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:30:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 09:30:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 09:30:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 09:30:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 09:30:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 09:30:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:12,638 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 09:30:12,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:30:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 09:30:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:30:12,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:12,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:30:12,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:12,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 09:30:12,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:12,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:12,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:12,779 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-04 09:30:12,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:12,780 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:12,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:12,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:13,034 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-04 09:30:13,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:13,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-04 09:30:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:30:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:30:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:30:13,071 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-04 09:30:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:13,149 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 09:30:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:30:13,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-04 09:30:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:13,153 INFO L225 Difference]: With dead ends: 6 [2018-10-04 09:30:13,153 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 09:30:13,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:30:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 09:30:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 09:30:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 09:30:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 09:30:13,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 09:30:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:13,157 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 09:30:13,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:30:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 09:30:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:30:13,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:13,158 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 09:30:13,158 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:13,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 09:30:13,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:13,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:13,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:13,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:13,261 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-04 09:30:13,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:13,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:13,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:13,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:13,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:13,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:13,432 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-04 09:30:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:13,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 09:30:13,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:30:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:30:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:30:13,454 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 09:30:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:13,499 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 09:30:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:30:13,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 09:30:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:13,501 INFO L225 Difference]: With dead ends: 7 [2018-10-04 09:30:13,501 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 09:30:13,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:30:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 09:30:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 09:30:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:30:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 09:30:13,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 09:30:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:13,505 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 09:30:13,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:30:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 09:30:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:30:13,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:13,507 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 09:30:13,507 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:13,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 09:30:13,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:13,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:13,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:30:13,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:13,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:13,746 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 09:30:13,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:13,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:30:14,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:14,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:30:14,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:30:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:30:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:30:14,012 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 09:30:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:14,058 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 09:30:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:30:14,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 09:30:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:14,059 INFO L225 Difference]: With dead ends: 8 [2018-10-04 09:30:14,059 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:30:14,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:30:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:30:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:30:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:30:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:30:14,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 09:30:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:14,064 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:30:14,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:30:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:30:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:30:14,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:14,065 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 09:30:14,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:14,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 09:30:14,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:14,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:14,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:14,155 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-04 09:30:14,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:14,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:14,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:14,178 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:14,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:14,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:14,339 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-04 09:30:14,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:14,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 09:30:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:30:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:30:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:30:14,361 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-04 09:30:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:14,469 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:30:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:30:14,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-04 09:30:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:14,471 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:30:14,471 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:30:14,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:30:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:30:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:30:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:30:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 09:30:14,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 09:30:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:14,475 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 09:30:14,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:30:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 09:30:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:30:14,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:14,476 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 09:30:14,476 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:14,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 09:30:14,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:14,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:14,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:14,711 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-04 09:30:14,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:14,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:14,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:30:14,731 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:30:14,731 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:14,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:15,219 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-04 09:30:15,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:15,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 09:30:15,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:30:15,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:30:15,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-04 09:30:15,255 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-04 09:30:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:15,388 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 09:30:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:30:15,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-04 09:30:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:15,390 INFO L225 Difference]: With dead ends: 10 [2018-10-04 09:30:15,390 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:30:15,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-04 09:30:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:30:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:30:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:30:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:30:15,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 09:30:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:15,396 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:30:15,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:30:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:30:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:30:15,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:15,397 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 09:30:15,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:15,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 09:30:15,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:15,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:15,570 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-04 09:30:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:15,571 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:30:15,593 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:30:15,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:15,787 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-04 09:30:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:15,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 09:30:15,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:30:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:30:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:30:15,810 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-04 09:30:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:16,144 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:30:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:30:16,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-04 09:30:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:16,145 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:30:16,145 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:30:16,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:30:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:30:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 09:30:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:30:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 09:30:16,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 09:30:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:16,151 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 09:30:16,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:30:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 09:30:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:30:16,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:16,152 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 09:30:16,152 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:16,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 09:30:16,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:16,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:16,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:16,552 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-04 09:30:16,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:16,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:16,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:16,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:16,959 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-04 09:30:16,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 09:30:16,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:30:16,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:30:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:30:16,983 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-04 09:30:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:17,131 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 09:30:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:30:17,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-04 09:30:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:17,132 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:30:17,132 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:30:17,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:30:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:30:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:30:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:30:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:30:17,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 09:30:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:17,137 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:30:17,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:30:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:30:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:30:17,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:17,138 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 09:30:17,139 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:17,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 09:30:17,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:17,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:17,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:17,448 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-04 09:30:17,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:17,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:17,467 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:17,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:17,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:17,771 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-04 09:30:17,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:17,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 09:30:17,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:30:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:30:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:30:17,793 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-04 09:30:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:17,929 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:30:17,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:30:17,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-04 09:30:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:17,931 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:30:17,931 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:30:17,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:30:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:30:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:30:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:30:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:30:17,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 09:30:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:17,937 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:30:17,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:30:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:30:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:30:17,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:17,938 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 09:30:17,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:17,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 09:30:17,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:18,185 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-04 09:30:18,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:18,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:18,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:18,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:30:18,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:18,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:18,574 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-04 09:30:18,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 09:30:18,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:30:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:30:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-10-04 09:30:18,608 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-04 09:30:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:18,859 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 09:30:18,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:30:18,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-04 09:30:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:18,861 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:30:18,861 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:30:18,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-10-04 09:30:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:30:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:30:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:30:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:30:18,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 09:30:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:18,865 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:30:18,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:30:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:30:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:30:18,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:18,866 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 09:30:18,867 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:18,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 09:30:18,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:18,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:19,077 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-04 09:30:19,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:19,078 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:19,097 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:19,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:19,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:19,824 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-04 09:30:19,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:19,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 09:30:19,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:30:19,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:30:19,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:30:19,846 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-04 09:30:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:20,028 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:30:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:30:20,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-04 09:30:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:20,030 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:30:20,030 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 09:30:20,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:30:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 09:30:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 09:30:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:30:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 09:30:20,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 09:30:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:20,036 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 09:30:20,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:30:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 09:30:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:30:20,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:20,036 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 09:30:20,037 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:20,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 09:30:20,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:20,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:20,668 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-04 09:30:20,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:20,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:20,677 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:30:20,689 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:30:20,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:20,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:21,195 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-04 09:30:21,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:21,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 09:30:21,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 09:30:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 09:30:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:30:21,218 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-04 09:30:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:21,656 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 09:30:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:30:21,657 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-04 09:30:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:21,657 INFO L225 Difference]: With dead ends: 16 [2018-10-04 09:30:21,657 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:30:21,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:30:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:30:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:30:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:30:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:30:21,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 09:30:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:21,662 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:30:21,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 09:30:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:30:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:30:21,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:21,663 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 09:30:21,663 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:21,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 09:30:21,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:21,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:22,059 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-04 09:30:22,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:22,060 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:30:22,090 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:30:22,090 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:22,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:22,679 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-04 09:30:22,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:22,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 09:30:22,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 09:30:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 09:30:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:30:22,701 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-04 09:30:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:23,026 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:30:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:30:23,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-04 09:30:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:23,028 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:30:23,028 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:30:23,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:30:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:30:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 09:30:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:30:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 09:30:23,034 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 09:30:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:23,034 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 09:30:23,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 09:30:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 09:30:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:30:23,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:23,035 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 09:30:23,035 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:23,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 09:30:23,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:23,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:23,407 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-04 09:30:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:23,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:23,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:23,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:24,146 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-04 09:30:24,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:24,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 09:30:24,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 09:30:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 09:30:24,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:30:24,168 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-04 09:30:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:24,553 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 09:30:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:30:24,554 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-04 09:30:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:24,555 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:30:24,555 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:30:24,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:30:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:30:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:30:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:30:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:30:24,560 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 09:30:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:24,560 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:30:24,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 09:30:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:30:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:30:24,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:24,561 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 09:30:24,561 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:24,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 09:30:24,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:24,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:25,183 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-04 09:30:25,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:25,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:25,211 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:25,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:25,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:26,132 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-04 09:30:26,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:26,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 09:30:26,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 09:30:26,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 09:30:26,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:30:26,153 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-04 09:30:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:26,523 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:30:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:30:26,523 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-04 09:30:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:26,524 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:30:26,524 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:30:26,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:30:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:30:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 09:30:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:30:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 09:30:26,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 09:30:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:26,531 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 09:30:26,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 09:30:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 09:30:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:30:26,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:26,532 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 09:30:26,532 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:26,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 09:30:26,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:26,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:26,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:27,275 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-04 09:30:27,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:27,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:27,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:27,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:30:27,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:27,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:28,871 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-04 09:30:28,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:28,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 09:30:28,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 09:30:28,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 09:30:28,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:30:28,897 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-04 09:30:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:29,399 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 09:30:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:30:29,399 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-04 09:30:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:29,400 INFO L225 Difference]: With dead ends: 20 [2018-10-04 09:30:29,400 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:30:29,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:30:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:30:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:30:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:30:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:30:29,406 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 09:30:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:29,406 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:30:29,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 09:30:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:30:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:30:29,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:29,407 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 09:30:29,408 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:29,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 09:30:29,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:29,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:30,084 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-04 09:30:30,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:30,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:30,107 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:30,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:30,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:30,828 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-04 09:30:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 09:30:30,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 09:30:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 09:30:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 09:30:30,852 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-04 09:30:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:31,498 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:30:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:30:31,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-04 09:30:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:31,500 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:30:31,500 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:30:31,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 09:30:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:30:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:30:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:30:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 09:30:31,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 09:30:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:31,506 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 09:30:31,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 09:30:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 09:30:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:30:31,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:31,506 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 09:30:31,507 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:31,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 09:30:31,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:31,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:32,114 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-04 09:30:32,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:32,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:32,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:30:32,198 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 09:30:32,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:32,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:33,100 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-04 09:30:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:33,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 09:30:33,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 09:30:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 09:30:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:30:33,122 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-04 09:30:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:33,880 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 09:30:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:30:33,880 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-04 09:30:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:33,881 INFO L225 Difference]: With dead ends: 22 [2018-10-04 09:30:33,881 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:30:33,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:30:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:30:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:30:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:30:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:30:33,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 09:30:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:33,888 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:30:33,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 09:30:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:30:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:30:33,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:33,889 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 09:30:33,889 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:33,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 09:30:33,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:33,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:33,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:33,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:34,521 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-04 09:30:34,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:34,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:34,530 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:30:34,555 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 09:30:34,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:34,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:35,870 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-04 09:30:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:35,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 09:30:35,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 09:30:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 09:30:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 09:30:35,904 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-04 09:30:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:36,669 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:30:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:30:36,670 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-04 09:30:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:36,670 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:30:36,670 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 09:30:36,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 09:30:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 09:30:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 09:30:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:30:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 09:30:36,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 09:30:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:36,676 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 09:30:36,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 09:30:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 09:30:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 09:30:36,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:36,677 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 09:30:36,678 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:36,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 09:30:36,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:36,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:36,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:37,450 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-04 09:30:37,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:37,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:37,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:38,895 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-04 09:30:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:38,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 09:30:38,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 09:30:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 09:30:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 09:30:38,926 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-04 09:30:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:39,865 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 09:30:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:30:39,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-04 09:30:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:39,866 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:30:39,866 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:30:39,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 09:30:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:30:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:30:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:30:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 09:30:39,878 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 09:30:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:39,878 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 09:30:39,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 09:30:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 09:30:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:30:39,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:39,879 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 09:30:39,880 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:39,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 09:30:39,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:39,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:39,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:30:40,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:40,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:40,634 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:40,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:40,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:30:42,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:42,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 09:30:42,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 09:30:42,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 09:30:42,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 09:30:42,138 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-04 09:30:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:43,085 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 09:30:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:30:43,086 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-04 09:30:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:43,087 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:30:43,087 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:30:43,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 09:30:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:30:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 09:30:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:30:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 09:30:43,092 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 09:30:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:43,092 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 09:30:43,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 09:30:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 09:30:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:30:43,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:43,093 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 09:30:43,093 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:43,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 09:30:43,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:43,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:43,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:43,969 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-04 09:30:43,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:43,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:43,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:44,006 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 09:30:44,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:44,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:45,964 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-04 09:30:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 09:30:45,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 09:30:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 09:30:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 09:30:45,987 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-04 09:30:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:46,935 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 09:30:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:30:46,937 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-04 09:30:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:46,938 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:30:46,938 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:30:46,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 09:30:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:30:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:30:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:30:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 09:30:46,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 09:30:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:46,943 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 09:30:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 09:30:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 09:30:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:30:46,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:46,944 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 09:30:46,945 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:46,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 09:30:46,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:46,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:46,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:46,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:47,868 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-04 09:30:47,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:47,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:47,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:47,901 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:47,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:47,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:49,495 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-04 09:30:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:49,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 09:30:49,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 09:30:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 09:30:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 09:30:49,516 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-04 09:30:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:50,619 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 09:30:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:30:50,619 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-04 09:30:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:50,620 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:30:50,621 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:30:50,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 09:30:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:30:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 09:30:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:30:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 09:30:50,627 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 09:30:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:50,628 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 09:30:50,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 09:30:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 09:30:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:30:50,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:50,629 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 09:30:50,629 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:50,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 09:30:50,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:50,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:50,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:50,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:51,501 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-04 09:30:51,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:51,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:30:51,545 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 09:30:51,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:51,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:53,393 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-04 09:30:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 09:30:53,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 09:30:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 09:30:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 09:30:53,415 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-04 09:30:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:55,031 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 09:30:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:30:55,032 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-04 09:30:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:55,033 INFO L225 Difference]: With dead ends: 28 [2018-10-04 09:30:55,033 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:30:55,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 09:30:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:30:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:30:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:30:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 09:30:55,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 09:30:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:55,039 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 09:30:55,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 09:30:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 09:30:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:30:55,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:55,040 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 09:30:55,040 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:55,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 09:30:55,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:55,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:55,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:55,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:56,234 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-04 09:30:56,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:56,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:30:56,242 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:30:56,280 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 09:30:56,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:56,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:58,325 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-04 09:30:58,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:58,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 09:30:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 09:30:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 09:30:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 09:30:58,347 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-04 09:30:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:59,611 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 09:30:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:30:59,612 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-04 09:30:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:59,613 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:30:59,613 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:30:59,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 09:30:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:30:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 09:30:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:30:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 09:30:59,620 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 09:30:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:59,620 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 09:30:59,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 09:30:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 09:30:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 09:30:59,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:59,621 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 09:30:59,622 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:30:59,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 09:30:59,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:59,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:59,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:00,718 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-04 09:31:00,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:00,719 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:31:00,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:00,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:03,375 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-04 09:31:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:03,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 09:31:03,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 09:31:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 09:31:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 09:31:03,397 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-04 09:31:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:04,681 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 09:31:04,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:31:04,683 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-04 09:31:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:04,683 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:31:04,684 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:31:04,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 09:31:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:31:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:31:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:31:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 09:31:04,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 09:31:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:04,689 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 09:31:04,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 09:31:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 09:31:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:31:04,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:04,690 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 09:31:04,690 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:04,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 09:31:04,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:04,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:06,615 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-04 09:31:06,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:06,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:31:06,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:31:06,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:31:06,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:06,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:09,212 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-04 09:31:09,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:09,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 09:31:09,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 09:31:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 09:31:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 09:31:09,234 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-04 09:31:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:11,228 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 09:31:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:31:11,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-04 09:31:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:11,229 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:31:11,230 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:31:11,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 09:31:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:31:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 09:31:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:31:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 09:31:11,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 09:31:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:11,235 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 09:31:11,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 09:31:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 09:31:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 09:31:11,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:11,236 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 09:31:11,237 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 09:31:11,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:11,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:11,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:13,171 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-04 09:31:13,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:13,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:31:13,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:31:13,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 09:31:13,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:13,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:15,939 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-04 09:31:15,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:15,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 09:31:15,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 09:31:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 09:31:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 09:31:15,962 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-04 09:31:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:18,242 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 09:31:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:31:18,242 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-04 09:31:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:18,243 INFO L225 Difference]: With dead ends: 32 [2018-10-04 09:31:18,243 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:31:18,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 09:31:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:31:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:31:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:31:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 09:31:18,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 09:31:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:18,251 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 09:31:18,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 09:31:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 09:31:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:31:18,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:18,252 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 09:31:18,252 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:18,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:18,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 09:31:18,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:18,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:18,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:18,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:19,758 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-04 09:31:19,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:19,759 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:31:19,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:31:19,803 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:31:19,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:19,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:22,682 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-04 09:31:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:22,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 09:31:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 09:31:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 09:31:22,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 09:31:22,712 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-04 09:31:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:24,851 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 09:31:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:31:24,852 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-04 09:31:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:24,853 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:31:24,853 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:31:24,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 09:31:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:31:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 09:31:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:31:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 09:31:24,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 09:31:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:24,860 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 09:31:24,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 09:31:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 09:31:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:31:24,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:24,861 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 09:31:24,861 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:24,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 09:31:24,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:24,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:24,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:26,487 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-04 09:31:26,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:26,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:31:26,501 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:31:26,551 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 09:31:26,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:26,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:29,862 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-04 09:31:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 09:31:29,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 09:31:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 09:31:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 09:31:29,884 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-04 09:31:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:31,729 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 09:31:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:31:31,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-04 09:31:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:31,730 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:31:31,730 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:31:31,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 09:31:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:31:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:31:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:31:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 09:31:31,737 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 09:31:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:31,737 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 09:31:31,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 09:31:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 09:31:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:31:31,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:31,738 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 09:31:31,738 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:31,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 09:31:31,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:31,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:31,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:31,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:33,553 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-04 09:31:33,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:33,554 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-04 09:31:33,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:31:33,624 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 09:31:33,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:33,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:37,154 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-04 09:31:37,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:37,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 09:31:37,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 09:31:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 09:31:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 09:31:37,176 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-04 09:31:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:39,507 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 09:31:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 09:31:39,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-04 09:31:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:39,508 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:31:39,508 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:31:39,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 09:31:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:31:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:31:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:31:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 09:31:39,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 09:31:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:39,514 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 09:31:39,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 09:31:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 09:31:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:31:39,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:39,515 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 09:31:39,515 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:39,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 09:31:39,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:39,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:39,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:39,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:41,362 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-04 09:31:41,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:41,363 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-04 09:31:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:41,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:45,548 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-04 09:31:45,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:45,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 09:31:45,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 09:31:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 09:31:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=3506, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 09:31:45,570 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-04 09:31:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:48,383 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 09:31:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:31:48,383 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-04 09:31:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:48,384 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:31:48,384 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:31:48,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=654, Invalid=3506, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 09:31:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:31:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 09:31:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:31:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 09:31:48,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 09:31:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:48,390 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 09:31:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 09:31:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 09:31:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:31:48,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:48,391 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 09:31:48,391 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:48,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 09:31:48,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:48,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:50,454 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-04 09:31:50,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:50,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 09:31:50,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:31:50,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:31:50,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:50,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:54,681 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-04 09:31:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 09:31:54,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 09:31:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 09:31:54,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 09:31:54,702 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-04 09:31:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:58,222 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 09:31:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 09:31:58,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-04 09:31:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:58,224 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:31:58,224 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 09:31:58,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 09:31:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 09:31:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 09:31:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 09:31:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 09:31:58,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 09:31:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:58,231 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 09:31:58,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 09:31:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 09:31:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 09:31:58,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:58,231 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 09:31:58,232 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:31:58,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 09:31:58,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:58,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:58,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:00,332 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-04 09:32:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:00,332 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-04 09:32:00,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:32:00,428 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 09:32:00,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:32:00,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:04,886 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-04 09:32:04,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:32:04,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 09:32:04,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 09:32:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 09:32:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 09:32:04,908 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-04 09:32:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:07,989 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 09:32:07,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 09:32:07,990 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-04 09:32:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:07,990 INFO L225 Difference]: With dead ends: 38 [2018-10-04 09:32:07,991 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:32:07,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 09:32:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:32:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:32:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:32:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 09:32:07,997 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 09:32:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:07,998 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 09:32:07,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 09:32:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 09:32:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:32:07,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:07,999 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 09:32:07,999 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:32:07,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 09:32:07,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:08,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:32:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:10,342 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-04 09:32:10,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:10,342 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-04 09:32:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:32:10,401 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:32:10,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:32:10,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:15,346 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-04 09:32:15,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:32:15,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 09:32:15,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 09:32:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 09:32:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 09:32:15,368 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-04 09:32:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:19,321 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 09:32:19,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 09:32:19,321 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-04 09:32:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:19,322 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:32:19,322 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 09:32:19,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 09:32:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 09:32:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 09:32:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 09:32:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 09:32:19,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 09:32:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:19,328 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 09:32:19,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 09:32:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 09:32:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:32:19,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:19,328 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 09:32:19,329 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:32:19,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 09:32:19,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:19,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:32:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:21,799 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-04 09:32:21,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:21,800 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-04 09:32:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:32:21,882 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 09:32:21,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:32:21,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:27,249 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-04 09:32:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:32:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 09:32:27,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 09:32:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 09:32:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 09:32:27,270 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-04 09:32:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:30,993 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 09:32:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:32:30,994 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-04 09:32:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:30,995 INFO L225 Difference]: With dead ends: 40 [2018-10-04 09:32:30,995 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:32:30,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 09:32:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:32:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 09:32:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:32:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 09:32:31,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 09:32:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:31,001 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 09:32:31,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 09:32:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 09:32:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:32:31,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:31,002 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 09:32:31,002 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:32:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 09:32:31,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:31,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:32:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:33,761 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-04 09:32:33,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:33,762 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-04 09:32:33,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:32:33,839 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 09:32:33,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:32:33,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:39,645 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-04 09:32:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:32:39,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 09:32:39,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 09:32:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 09:32:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 09:32:39,666 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-04 09:32:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:44,480 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 09:32:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 09:32:44,480 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-04 09:32:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:44,481 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:32:44,481 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:32:44,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 09:32:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:32:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 09:32:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 09:32:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 09:32:44,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 09:32:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:44,486 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 09:32:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 09:32:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 09:32:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:32:44,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:44,487 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 09:32:44,487 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:32:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 09:32:44,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:44,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:32:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:47,335 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-04 09:32:47,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:47,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 09:32:47,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:32:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:47,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:53,547 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-04 09:32:53,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:32:53,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 09:32:53,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 09:32:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 09:32:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 09:32:53,568 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-04 09:32:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:58,335 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 09:32:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 09:32:58,336 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-04 09:32:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:58,336 INFO L225 Difference]: With dead ends: 42 [2018-10-04 09:32:58,337 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:32:58,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 09:32:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:32:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 09:32:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:32:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 09:32:58,343 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 09:32:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 09:32:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 09:32:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 09:32:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 09:32:58,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:58,344 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 09:32:58,344 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:32:58,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 09:32:58,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:58,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:32:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:33:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:01,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:33:01,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:33:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:33:01,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:33:01,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:33:01,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:33:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:33:08,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 09:33:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 09:33:08,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 09:33:08,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 09:33:08,278 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-04 09:33:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:33:13,045 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 09:33:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 09:33:13,046 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-04 09:33:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:33:13,047 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:33:13,047 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 09:33:13,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 09:33:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 09:33:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 09:33:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:33:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 09:33:13,051 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 09:33:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:33:13,052 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 09:33:13,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 09:33:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 09:33:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:33:13,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:33:13,052 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 09:33:13,052 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:33:13,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:33:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 09:33:13,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:33:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:33:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:13,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:33:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:33:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:16,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:33:16,415 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:33:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:33:16,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 09:33:16,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:33:16,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:33:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:33:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 09:33:23,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 09:33:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 09:33:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 09:33:23,711 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-04 09:33:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:33:28,268 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 09:33:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 09:33:28,268 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-04 09:33:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:33:28,269 INFO L225 Difference]: With dead ends: 44 [2018-10-04 09:33:28,269 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:33:28,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 09:33:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:33:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:33:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:33:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 09:33:28,275 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 09:33:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:33:28,275 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 09:33:28,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 09:33:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 09:33:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 09:33:28,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:33:28,276 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 09:33:28,276 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:33:28,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:33:28,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 09:33:28,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:33:28,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:33:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:28,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:33:28,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:33:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:31,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:33:31,923 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:33:31,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:33:31,999 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:33:32,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:33:32,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:33:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:33:39,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 09:33:39,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 09:33:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 09:33:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 09:33:39,765 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-04 09:33:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:33:44,216 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 09:33:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 09:33:44,216 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-04 09:33:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:33:44,217 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:33:44,217 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 09:33:44,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 09:33:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 09:33:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 09:33:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:33:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 09:33:44,222 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 09:33:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:33:44,222 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 09:33:44,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 09:33:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 09:33:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 09:33:44,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:33:44,223 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 09:33:44,223 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:33:44,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:33:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 09:33:44,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:33:44,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:33:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:44,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:33:44,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:33:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:33:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:48,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:33:48,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:33:48,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:33:48,240 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 09:33:48,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:33:48,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:33:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:33:56,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:33:56,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 09:33:56,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 09:33:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 09:33:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 09:33:56,580 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-04 09:34:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:34:01,567 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 09:34:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 09:34:01,568 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-04 09:34:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:34:01,569 INFO L225 Difference]: With dead ends: 46 [2018-10-04 09:34:01,569 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:34:01,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 09:34:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:34:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 09:34:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:34:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 09:34:01,575 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 09:34:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:34:01,575 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 09:34:01,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 09:34:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 09:34:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:34:01,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:34:01,576 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 09:34:01,576 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:34:01,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:34:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 09:34:01,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:34:01,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:34:01,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:34:01,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:34:01,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:34:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:34:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:34:05,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:34:05,813 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:34:05,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:34:05,954 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 09:34:05,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:34:06,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:34:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:34:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:34:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 09:34:14,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 09:34:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 09:34:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 09:34:14,901 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-04 09:34:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:34:20,092 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 09:34:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 09:34:20,092 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-04 09:34:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:34:20,093 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:34:20,093 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 09:34:20,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 09:34:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 09:34:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 09:34:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 09:34:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 09:34:20,098 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 09:34:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:34:20,098 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 09:34:20,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 09:34:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 09:34:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 09:34:20,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:34:20,098 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 09:34:20,099 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:34:20,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:34:20,099 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 09:34:20,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:34:20,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:34:20,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:34:20,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:34:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:34:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:34:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:34:24,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:34:24,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:34:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:34:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:34:24,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:34:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:34:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:34:34,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 09:34:34,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 09:34:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 09:34:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=6668, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 09:34:34,448 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. Received shutdown request... [2018-10-04 09:34:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 09:34:39,783 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:34:39,787 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:34:39,788 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:34:39 BoogieIcfgContainer [2018-10-04 09:34:39,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:34:39,789 INFO L168 Benchmark]: Toolchain (without parser) took 267843.28 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -13.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:34:39,790 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-04 09:34:39,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.21 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-04 09:34:39,791 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 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-04 09:34:39,791 INFO L168 Benchmark]: RCFGBuilder took 226.68 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-04 09:34:39,792 INFO L168 Benchmark]: TraceAbstraction took 267540.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -34.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:34:39,795 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 46.21 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 25.14 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 226.68 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 267540.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 27.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -34.6 MB). There was no memory consumed. 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 (46states) and FLOYD_HOARE automaton (currently 43 states, 89 states before enhancement), while ReachableStatesComputation was computing reachable states (41 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 267.4s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 80.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 34943 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13244 ImplicationChecksByTransitivity, 176.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 181.8s InterpolantComputationTime, 2066 NumberOfCodeBlocks, 2066 NumberOfCodeBlocksAsserted, 339 NumberOfCheckSat, 1979 ConstructedInterpolants, 0 QuantifiedInterpolants, 569581 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4085 ConjunctsInSsa, 2021 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/28380 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-34-39-804.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/GeometricalCake.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-34-39-804.csv Completed graceful shutdown