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-9f4048f [2018-10-04 12:35:59,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:35:59,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:35:59,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:35:59,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:35:59,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:35:59,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:35:59,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:35:59,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:35:59,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:35:59,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:35:59,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:35:59,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:35:59,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:35:59,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:35:59,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:35:59,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:35:59,801 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:35:59,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:35:59,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:35:59,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:35:59,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:35:59,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:35:59,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:35:59,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:35:59,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:35:59,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:35:59,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:35:59,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:35:59,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:35:59,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:35:59,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:35:59,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:35:59,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:35:59,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:35:59,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:35:59,832 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 12:35:59,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:35:59,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:35:59,863 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:35:59,863 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:35:59,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:35:59,864 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:35:59,864 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:35:59,864 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:35:59,864 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:35:59,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:35:59,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:35:59,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:35:59,866 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:35:59,866 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:35:59,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:35:59,867 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:35:59,867 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:35:59,867 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:35:59,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:35:59,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:35:59,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:35:59,869 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:35:59,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:35:59,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:35:59,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:35:59,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:35:59,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:35:59,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:35:59,936 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:35:59,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:35:59,937 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 12:35:59,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-10-04 12:35:59,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:35:59,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:35:59,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:35:59,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:35:59,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:36:00,009 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 12:35:59" (1/1) ... [2018-10-04 12:36:00,021 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 12:35:59" (1/1) ... [2018-10-04 12:36:00,027 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:36:00,027 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:36:00,027 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:36:00,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:36:00,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:36:00,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:36:00,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:36:00,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... [2018-10-04 12:36:00,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:36:00,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:36:00,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:36:00,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:36:00,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:36:00,131 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:36:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:36:00,131 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:36:00,328 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:36:00,328 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:36:00 BoogieIcfgContainer [2018-10-04 12:36:00,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:36:00,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:36:00,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:36:00,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:36:00,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:35:59" (1/2) ... [2018-10-04 12:36:00,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2080008e and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:36:00, skipping insertion in model container [2018-10-04 12:36:00,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:36:00" (2/2) ... [2018-10-04 12:36:00,337 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-10-04 12:36:00,347 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:36:00,355 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:36:00,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:36:00,408 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:36:00,408 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:36:00,408 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:36:00,409 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:36:00,409 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:36:00,409 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:36:00,409 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:36:00,409 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:36:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 12:36:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:36:00,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:00,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:36:00,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:00,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 12:36:00,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:00,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:00,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:36:00,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:36:00,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:36:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:36:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:36:00,613 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 12:36:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:00,658 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:36:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:36:00,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:36:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:00,672 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:36:00,672 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 12:36:00,677 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 12:36:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 12:36:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 12:36:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 12:36:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 12:36:00,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 12:36:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:00,715 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 12:36:00,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:36:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 12:36:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:36:00,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:00,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:36:00,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:00,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 12:36:00,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:00,868 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 12:36:00,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:00,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:36:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:00,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:00,976 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 12:36:01,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:01,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-10-04 12:36:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:36:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:36:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:36:01,009 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-10-04 12:36:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:01,119 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 12:36:01,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:36:01,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-10-04 12:36:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:01,121 INFO L225 Difference]: With dead ends: 6 [2018-10-04 12:36:01,121 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:36:01,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:36:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:36:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:36:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:36:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:36:01,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:36:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:01,125 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:36:01,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:36:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:36:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:36:01,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:01,126 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 12:36:01,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:01,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 12:36:01,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:01,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:01,232 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 12:36:01,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:01,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:01,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:01,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:01,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:01,416 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 12:36:01,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:01,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 12:36:01,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:36:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:36:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:36:01,438 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 12:36:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:01,481 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 12:36:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:36:01,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 12:36:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:01,482 INFO L225 Difference]: With dead ends: 7 [2018-10-04 12:36:01,483 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:36:01,483 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 12:36:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:36:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:36:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:36:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:36:01,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:36:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:01,486 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:36:01,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:36:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:36:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:36:01,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:01,487 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 12:36:01,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:01,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 12:36:01,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:01,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:01,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:01,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:01,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:36:01,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:01,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:01,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:36:01,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:36:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:36:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:36:01,986 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-10-04 12:36:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:02,028 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:36:02,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:36:02,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-10-04 12:36:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:02,029 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:36:02,030 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:36:02,030 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 12:36:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:36:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:36:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:36:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:36:02,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:36:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:02,035 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:36:02,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:36:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:36:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:36:02,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:02,036 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 12:36:02,036 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:02,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 12:36:02,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:02,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:02,165 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 12:36:02,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:02,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:02,196 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:02,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:02,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:02,420 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 12:36:02,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:36:02,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:02,442 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-10-04 12:36:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:02,552 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:36:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:36:02,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-10-04 12:36:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:02,553 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:36:02,553 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:36:02,553 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 12:36:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:36:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:36:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:36:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:36:02,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:36:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:02,557 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:36:02,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:36:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:36:02,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:02,558 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 12:36:02,559 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:02,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:02,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 12:36:02,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:02,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:02,696 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 12:36:02,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:02,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:02,715 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:36:02,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:02,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:03,215 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 12:36:03,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:03,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:36:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:36:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:36:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:36:03,240 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-10-04 12:36:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:03,329 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:36:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:36:03,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-10-04 12:36:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:03,330 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:36:03,330 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:36:03,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:36:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:36:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:36:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:36:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:36:03,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:36:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:03,335 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:36:03,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:36:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:36:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:36:03,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:03,336 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 12:36:03,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:03,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 12:36:03,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:03,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:03,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:03,516 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 12:36:03,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:03,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:03,534 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:36:03,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:03,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:03,719 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 12:36:03,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:03,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:36:03,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:36:03,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:36:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:36:03,742 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-10-04 12:36:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:04,220 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:36:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:36:04,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-10-04 12:36:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:04,222 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:36:04,222 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:36:04,223 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 12:36:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:36:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:36:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:36:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:36:04,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:36:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:04,229 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:36:04,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:36:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:36:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:36:04,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:04,230 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 12:36:04,230 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:04,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 12:36:04,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:04,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:04,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:04,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:04,569 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 12:36:04,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:04,570 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:04,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:04,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:04,915 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 12:36:04,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:36:04,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:36:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:36:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:36:04,939 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-10-04 12:36:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:05,064 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:36:05,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:36:05,064 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-10-04 12:36:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:05,065 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:36:05,065 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:36:05,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:36:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:36:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:36:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:36:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:36:05,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:36:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:36:05,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:36:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:36:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:36:05,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:05,071 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 12:36:05,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:05,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 12:36:05,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:05,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:05,437 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 12:36:05,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:05,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:05,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:05,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:05,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:05,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:05,758 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 12:36:05,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:05,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 12:36:05,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:36:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:36:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:36:05,781 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-10-04 12:36:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:05,930 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:36:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:05,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-10-04 12:36:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:05,932 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:36:05,932 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:36:05,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:36:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:36:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:36:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:36:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:36:05,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:36:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:05,939 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:36:05,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:36:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:36:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:36:05,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:05,940 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 12:36:05,940 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:05,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 12:36:05,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:05,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:05,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:06,216 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 12:36:06,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:06,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:06,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:06,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:36:06,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:06,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:06,612 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 12:36:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:06,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:36:06,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:36:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:36:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:36:06,638 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-10-04 12:36:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:06,823 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:36:06,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:36:06,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-10-04 12:36:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:06,824 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:36:06,825 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:36:06,825 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 12:36:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:36:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:36:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:36:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:36:06,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 12:36:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:06,830 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:36:06,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:36:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:36:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:36:06,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:06,831 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 12:36:06,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:06,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 12:36:06,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:07,192 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 12:36:07,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:07,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:07,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:07,219 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:07,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:07,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:07,858 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 12:36:07,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:07,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 12:36:07,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:36:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:36:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:36:07,880 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-10-04 12:36:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:08,059 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:36:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:36:08,059 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-10-04 12:36:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:08,060 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:36:08,060 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:36:08,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:36:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:36:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:36:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:36:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 12:36:08,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 12:36:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:08,065 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 12:36:08,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:36:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 12:36:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:36:08,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:08,066 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 12:36:08,066 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:08,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 12:36:08,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:08,455 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 12:36:08,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:08,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:08,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:08,478 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:36:08,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:08,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:09,030 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 12:36:09,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:36:09,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:36:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:36:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:36:09,056 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-10-04 12:36:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:09,316 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 12:36:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:36:09,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-10-04 12:36:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:09,317 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:36:09,317 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:36:09,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:36:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:36:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:36:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:36:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:36:09,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 12:36:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:09,323 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:36:09,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:36:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:36:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:36:09,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:09,324 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 12:36:09,324 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 12:36:09,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:09,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:09,633 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 12:36:09,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:09,634 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:09,663 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:36:09,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:09,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:10,161 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 12:36:10,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:10,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:36:10,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:36:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:36:10,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:36:10,185 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-10-04 12:36:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:11,038 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:36:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:36:11,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-10-04 12:36:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:11,039 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:36:11,039 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:36:11,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:36:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:36:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:36:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:36:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:36:11,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 12:36:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:11,044 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:36:11,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:36:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:36:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:36:11,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:11,045 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 12:36:11,045 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 12:36:11,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:11,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:11,694 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 12:36:11,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:11,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:11,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:11,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:12,366 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 12:36:12,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:36:12,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:36:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:36:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:36:12,388 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-10-04 12:36:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:12,790 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 12:36:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:36:12,791 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-10-04 12:36:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:12,791 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:36:12,792 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:36:12,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:36:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:36:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:36:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:36:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:36:12,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 12:36:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:12,797 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:36:12,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:36:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:36:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:36:12,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:12,798 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 12:36:12,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 12:36:12,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:12,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:13,533 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 12:36:13,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:13,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:13,574 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:13,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:13,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:14,392 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 12:36:14,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:14,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 12:36:14,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:36:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:36:14,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:36:14,414 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-10-04 12:36:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:14,778 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:36:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:36:14,778 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-10-04 12:36:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:14,779 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:36:14,779 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:36:14,780 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 12:36:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:36:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:36:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:36:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 12:36:14,784 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 12:36:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:14,785 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 12:36:14,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:36:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 12:36:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:36:14,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:14,786 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 12:36:14,786 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 12:36:14,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:14,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:15,490 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 12:36:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:15,491 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:15,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:15,518 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:15,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:15,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:16,657 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 12:36:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:36:16,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:36:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:36:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:36:16,682 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-10-04 12:36:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:17,209 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:36:17,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:36:17,210 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-10-04 12:36:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:17,211 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:36:17,211 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:36:17,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:36:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:36:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:36:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:36:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:36:17,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 12:36:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:17,217 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:36:17,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:36:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:36:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:36:17,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:17,218 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 12:36:17,218 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:17,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 12:36:17,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:17,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:17,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:17,650 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 12:36:17,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:17,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:17,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:17,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:17,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:17,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:18,425 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 12:36:18,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:18,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 12:36:18,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:36:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:36:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:36:18,447 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-10-04 12:36:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:19,074 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:36:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:36:19,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-10-04 12:36:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:19,075 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:36:19,075 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:36:19,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:36:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:36:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:36:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:36:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 12:36:19,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 12:36:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:19,081 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 12:36:19,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:36:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 12:36:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:19,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:19,081 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 12:36:19,082 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:19,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 12:36:19,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:19,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:19,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:19,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:19,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:19,595 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 12:36:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:19,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:19,670 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 12:36:19,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:19,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:20,532 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 12:36:20,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:20,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:36:20,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:36:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:36:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:36:20,553 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-10-04 12:36:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:21,203 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 12:36:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:36:21,204 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-10-04 12:36:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:21,204 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:36:21,204 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:36:21,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:36:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:36:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:36:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:36:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:36:21,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 12:36:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:21,210 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:36:21,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:36:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:36:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:36:21,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:21,210 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 12:36:21,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:21,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 12:36:21,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:21,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:21,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:21,834 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 12:36:21,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:21,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:21,843 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:21,872 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 12:36:21,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:21,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:23,003 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 12:36:23,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:23,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 12:36:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:36:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:36:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:36:23,027 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-10-04 12:36:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:23,771 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:36:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:36:23,772 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-10-04 12:36:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:23,773 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:36:23,773 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:36:23,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:36:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:36:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:36:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:36:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:36:23,779 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 12:36:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:23,779 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:36:23,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:36:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:36:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:36:23,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:23,780 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 12:36:23,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:23,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 12:36:23,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:23,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:23,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:24,403 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 12:36:24,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:24,404 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:24,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:24,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:25,902 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 12:36:25,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:25,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 12:36:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:36:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:36:25,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:36:25,933 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-10-04 12:36:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:26,901 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 12:36:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:36:26,902 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-10-04 12:36:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:26,902 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:36:26,902 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:36:26,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:36:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:36:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:36:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:36:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:36:26,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 12:36:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:36:26,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:36:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:36:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:36:26,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:26,914 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 12:36:26,914 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:26,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 12:36:26,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:26,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:27,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:27,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:27,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:27,697 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:27,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:27,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:29,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:29,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 12:36:29,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:36:29,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:36:29,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:36:29,276 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-10-04 12:36:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:30,161 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:36:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:36:30,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-10-04 12:36:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:30,162 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:36:30,162 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:36:30,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:36:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:36:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:36:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:36:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 12:36:30,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 12:36:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:30,167 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 12:36:30,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:36:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 12:36:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:36:30,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:30,168 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 12:36:30,169 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:30,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:30,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 12:36:30,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:30,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:30,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:30,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:31,024 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 12:36:31,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:31,025 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:31,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:31,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:36:31,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:31,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:33,087 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 12:36:33,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:33,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 12:36:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:36:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:36:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:36:33,110 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-10-04 12:36:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:33,995 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:36:33,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:36:33,998 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-10-04 12:36:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:33,998 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:36:33,998 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:36:33,999 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 12:36:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:36:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:36:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:36:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:36:34,014 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 12:36:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:34,014 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:36:34,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:36:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:36:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:36:34,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:34,015 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 12:36:34,015 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 12:36:34,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:34,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:34,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:34,812 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 12:36:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:34,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:34,847 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:34,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:34,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:36,436 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 12:36:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:36,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 12:36:36,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:36:36,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:36:36,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:36:36,458 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-10-04 12:36:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:37,610 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:36:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:36:37,610 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-10-04 12:36:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:37,611 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:36:37,611 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:36:37,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:36:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:36:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:36:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:36:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:36:37,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 12:36:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:37,617 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:36:37,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:36:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:36:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:36:37,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:37,618 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 12:36:37,618 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:37,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 12:36:37,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:37,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:37,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:38,560 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 12:36:38,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:38,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:38,603 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 12:36:38,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:38,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:40,466 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 12:36:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 12:36:40,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:36:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:36:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:36:40,488 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-10-04 12:36:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:42,172 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 12:36:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:36:42,173 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-10-04 12:36:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:42,173 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:36:42,173 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:36:42,175 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 12:36:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:36:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:36:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:36:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:36:42,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 12:36:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:36:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:36:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:36:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:36:42,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:42,180 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 12:36:42,180 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:42,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 12:36:42,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:42,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:42,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:42,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:44,135 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 12:36:44,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:44,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:44,144 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:44,184 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:36:44,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:44,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:46,196 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 12:36:46,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:46,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 12:36:46,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:36:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:36:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:36:46,218 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-10-04 12:36:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:47,499 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:36:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:36:47,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-10-04 12:36:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:47,500 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:36:47,500 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:36:47,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=423, Invalid=2127, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:36:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:36:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 12:36:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:36:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 12:36:47,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 12:36:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:47,514 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 12:36:47,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:36:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 12:36:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:36:47,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:47,515 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 12:36:47,515 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:47,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 12:36:47,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:48,674 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 12:36:48,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:48,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:48,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:48,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:51,446 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 12:36:51,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:51,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 12:36:51,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:36:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:36:51,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:36:51,468 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-10-04 12:36:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:52,814 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:36:52,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:36:52,814 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-10-04 12:36:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:52,815 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:36:52,815 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:36:52,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:36:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:36:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:36:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:36:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:36:52,822 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 12:36:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:52,822 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:36:52,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:36:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:36:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:36:52,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:52,823 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 12:36:52,823 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:52,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 12:36:52,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:52,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:54,000 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 12:36:54,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:54,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:54,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:54,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:54,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:56,575 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 12:36:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:56,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 12:36:56,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:36:56,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:36:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:36:56,602 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-10-04 12:36:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:58,664 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:36:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:36:58,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-10-04 12:36:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:58,665 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:36:58,665 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:36:58,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:36:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:36:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:36:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 12:36:58,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 12:36:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:58,671 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 12:36:58,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:36:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 12:36:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:36:58,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:58,672 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 12:36:58,672 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:58,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 12:36:58,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:58,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:00,681 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 12:37:00,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:00,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:00,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:00,736 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 12:37:00,736 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:00,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:03,547 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 12:37:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 12:37:03,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:37:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:37:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:37:03,569 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-10-04 12:37:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:05,819 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 12:37:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:37:05,820 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-10-04 12:37:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:05,820 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:37:05,821 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:37:05,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=516, Invalid=2676, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:37:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:37:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:37:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:37:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:37:05,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 12:37:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:05,827 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:37:05,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:37:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:37:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:37:05,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:05,828 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 12:37:05,828 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:05,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 12:37:05,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:05,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:05,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:07,215 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 12:37:07,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:07,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:07,259 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:07,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:07,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:10,307 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 12:37:10,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:10,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 12:37:10,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:37:10,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:37:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:37:10,335 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-10-04 12:37:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:12,505 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:37:12,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:37:12,506 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-10-04 12:37:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:12,506 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:37:12,507 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:37:12,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:37:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:37:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:37:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:37:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:37:12,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 12:37:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:12,514 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:37:12,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:37:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:37:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:37:12,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:12,515 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 12:37:12,515 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:12,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 12:37:12,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:12,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:12,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:12,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:14,162 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 12:37:14,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:14,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:14,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:14,227 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 12:37:14,227 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:14,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:17,406 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 12:37:17,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:17,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 12:37:17,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:37:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:37:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:37:17,428 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-10-04 12:37:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:19,296 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 12:37:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:37:19,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-10-04 12:37:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:19,297 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:37:19,297 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:37:19,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=583, Invalid=3077, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:37:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:37:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:37:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:37:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:37:19,304 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 12:37:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:19,304 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:37:19,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:37:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:37:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:37:19,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:19,305 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 12:37:19,305 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:19,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 12:37:19,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:19,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:19,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:21,037 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 12:37:21,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:21,038 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 12:37:21,048 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:37:21,107 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 12:37:21,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:21,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:24,595 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 12:37:24,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:24,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 12:37:24,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:37:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:37:24,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:37:24,618 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-10-04 12:37:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:26,978 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:37:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:37:26,978 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-10-04 12:37:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:26,979 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:37:26,979 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:37:26,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=618, Invalid=3288, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:37:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:37:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:37:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:37:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 12:37:26,985 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 12:37:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:26,985 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 12:37:26,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:37:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 12:37:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:37:26,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:26,986 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 12:37:26,986 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:26,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 12:37:26,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:26,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:26,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:28,789 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 12:37:28,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:28,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:37:28,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:28,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:33,006 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 12:37:33,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:33,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 12:37:33,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:37:33,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:37:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=3506, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:37:33,027 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-10-04 12:37:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:35,909 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 12:37:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:37:35,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-10-04 12:37:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:35,910 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:37:35,911 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:37:35,912 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 12:37:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:37:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:37:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:37:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 12:37:35,916 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 12:37:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:35,916 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 12:37:35,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:37:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 12:37:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:37:35,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:35,917 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 12:37:35,917 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:35,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 12:37:35,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:35,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:37,861 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 12:37:37,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:37,862 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 12:37:37,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:37:37,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:37:37,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:37,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:42,085 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 12:37:42,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 12:37:42,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:37:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:37:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:37:42,108 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-10-04 12:37:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:45,662 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 12:37:45,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:37:45,663 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-10-04 12:37:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:45,664 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:37:45,664 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:37:45,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=691, Invalid=3731, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:37:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:37:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 12:37:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:37:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 12:37:45,670 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 12:37:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:45,670 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 12:37:45,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:37:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 12:37:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:37:45,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:45,671 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 12:37:45,671 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:45,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 12:37:45,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:45,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:47,825 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 12:37:47,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:47,826 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 12:37:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:47,919 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 12:37:47,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:47,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:52,456 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 12:37:52,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:52,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 12:37:52,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:37:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:37:52,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:37:52,477 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-10-04 12:37:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:55,524 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 12:37:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:37:55,525 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-10-04 12:37:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:55,526 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:37:55,526 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:37:55,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=729, Invalid=3963, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:37:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:37:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:37:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:37:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:37:55,532 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 12:37:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:37:55,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:37:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:37:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:37:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:55,533 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 12:37:55,533 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 12:37:55,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:55,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:57,959 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 12:37:57,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:57,960 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 12:37:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:58,014 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:58,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:58,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:38:02,917 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 12:38:02,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:38:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 12:38:02,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 12:38:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 12:38:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:38:02,938 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-10-04 12:38:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:38:06,845 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:38:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:38:06,846 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-10-04 12:38:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:38:06,847 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:38:06,847 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:38:06,847 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 12:38:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:38:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 12:38:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:38:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 12:38:06,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 12:38:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:38:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 12:38:06,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 12:38:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 12:38:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:38:06,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:38:06,854 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 12:38:06,854 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:38:06,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:38:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 12:38:06,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:38:06,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:38:06,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:06,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:38:06,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:38:09,415 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 12:38:09,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:38:09,416 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 12:38:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:38:09,497 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 12:38:09,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:38:09,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:38:14,871 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 12:38:14,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:38:14,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 12:38:14,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:38:14,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:38:14,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:38:14,893 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-10-04 12:38:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:38:18,538 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 12:38:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:38:18,539 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-10-04 12:38:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:38:18,540 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:38:18,540 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:38:18,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=808, Invalid=4448, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:38:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:38:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:38:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:38:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 12:38:18,546 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 12:38:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:38:18,546 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 12:38:18,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:38:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 12:38:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:38:18,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:38:18,547 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 12:38:18,547 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:38:18,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:38:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 12:38:18,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:38:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:38:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:18,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:38:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:38:21,306 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 12:38:21,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:38:21,307 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 12:38:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:38:21,381 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:38:21,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:38:21,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:38:27,204 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 12:38:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:38:27,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 12:38:27,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:38:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:38:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:38:27,226 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-10-04 12:38:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:38:31,919 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 12:38:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:38:31,919 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-10-04 12:38:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:38:31,920 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:38:31,920 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:38:31,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=849, Invalid=4701, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:38:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:38:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 12:38:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:38:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 12:38:31,926 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 12:38:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:38:31,927 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 12:38:31,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:38:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 12:38:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:38:31,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:38:31,927 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 12:38:31,928 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:38:31,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:38:31,928 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 12:38:31,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:38:31,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:38:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:31,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:38:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:38:34,869 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 12:38:34,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:38:34,870 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 12:38:34,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:38:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:38:34,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:38:41,180 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 12:38:41,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:38:41,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 12:38:41,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:38:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:38:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:38:41,203 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-10-04 12:38:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:38:45,861 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 12:38:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:38:45,861 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-10-04 12:38:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:38:45,862 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:38:45,862 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:38:45,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=891, Invalid=4961, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:38:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:38:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:38:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:38:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:38:45,867 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 12:38:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:38:45,867 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:38:45,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:38:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:38:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:38:45,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:38:45,867 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 12:38:45,867 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:38:45,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:38:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 12:38:45,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:38:45,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:38:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:38:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:38:48,972 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 12:38:48,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:38:48,972 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 12:38:48,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:38:49,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:38:49,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:38:49,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:38:55,854 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 12:38:55,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:38:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 12:38:55,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:38:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:38:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:38:55,877 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-10-04 12:39:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:39:00,498 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:39:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:39:00,499 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-10-04 12:39:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:39:00,499 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:39:00,500 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:39:00,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=934, Invalid=5228, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:39:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:39:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:39:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:39:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 12:39:00,504 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 12:39:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:39:00,505 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 12:39:00,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:39:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 12:39:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:39:00,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:39:00,506 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 12:39:00,506 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:39:00,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:39:00,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 12:39:00,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:39:00,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:39:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:00,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:39:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:39:03,907 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 12:39:03,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:39:03,907 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 12:39:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:39:04,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 12:39:04,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:39:04,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:39:11,272 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 12:39:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:39:11,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 12:39:11,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:39:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:39:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:39:11,294 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-10-04 12:39:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:39:15,887 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 12:39:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:39:15,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-10-04 12:39:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:39:15,888 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:39:15,889 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:39:15,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=978, Invalid=5502, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:39:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:39:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:39:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:39:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 12:39:15,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 12:39:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:39:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 12:39:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:39:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 12:39:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:39:15,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:39:15,895 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 12:39:15,895 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:39:15,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:39:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 12:39:15,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:39:15,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:39:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:15,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:39:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:39:19,593 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 12:39:19,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:39:19,593 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 12:39:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:39:19,669 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:39:19,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:39:19,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:39:27,463 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 12:39:27,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:39:27,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 12:39:27,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 12:39:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 12:39:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:39:27,484 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-10-04 12:39:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:39:31,935 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 12:39:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:39:31,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-10-04 12:39:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:39:31,936 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:39:31,937 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:39:31,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1023, Invalid=5783, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:39:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:39:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:39:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:39:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 12:39:31,942 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 12:39:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:39:31,943 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 12:39:31,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 12:39:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 12:39:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:39:31,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:39:31,943 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 12:39:31,944 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:39:31,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:39:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 12:39:31,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:39:31,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:39:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:31,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:39:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:39:35,845 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 12:39:35,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:39:35,846 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 12:39:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:39:35,970 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 12:39:35,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:39:36,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:39:44,372 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 12:39:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:39:44,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 12:39:44,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 12:39:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 12:39:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:39:44,393 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-10-04 12:39:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:39:49,408 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 12:39:49,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:39:49,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-10-04 12:39:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:39:49,409 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:39:49,409 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:39:49,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1069, Invalid=6071, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:39:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:39:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:39:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:39:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:39:49,416 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 12:39:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:39:49,416 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:39:49,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 12:39:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:39:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:39:49,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:39:49,417 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 12:39:49,417 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:39:49,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:39:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 12:39:49,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:39:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:39:49,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:49,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:39:49,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:39:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:39:53,703 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 12:39:53,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:39:53,703 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 12:39:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:39:53,853 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 12:39:53,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:39:53,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:40:02,921 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 12:40:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:40:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 12:40:02,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 12:40:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 12:40:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:40:02,944 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-10-04 12:40:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:40:08,167 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:40:08,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:40:08,168 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-10-04 12:40:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:40:08,168 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:40:08,168 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:40:08,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:40:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:40:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 12:40:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:40:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 12:40:08,174 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 12:40:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:40:08,174 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 12:40:08,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 12:40:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 12:40:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:40:08,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:40:08,174 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 12:40:08,175 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:40:08,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:40:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 12:40:08,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:40:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:40:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:40:08,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:40:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:40:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:40:12,615 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 12:40:12,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:40:12,616 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 12:40:12,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:40:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:40:12,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:40:22,510 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 12:40:22,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:40:22,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 12:40:22,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 12:40:22,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 12:40:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1164, Invalid=6668, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:40:22,532 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. Received shutdown request... [2018-10-04 12:40:28,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:40:28,163 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:40:28,169 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:40:28,169 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:40:28 BoogieIcfgContainer [2018-10-04 12:40:28,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:40:28,170 INFO L168 Benchmark]: Toolchain (without parser) took 268185.75 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 55.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 40.1 MB). Peak memory consumption was 95.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:40:28,172 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:40:28,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.88 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 12:40:28,173 INFO L168 Benchmark]: Boogie Preprocessor took 21.31 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 12:40:28,173 INFO L168 Benchmark]: RCFGBuilder took 276.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:40:28,174 INFO L168 Benchmark]: TraceAbstraction took 267839.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 55.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:40:28,177 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.88 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 21.31 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 276.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267839.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 55.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 18.9 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (46states) and FLOYD_HOARE automaton (currently 45 states, 89 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 267.7s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 80.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 35039 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13244 ImplicationChecksByTransitivity, 176.6s 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.6s 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_12-40-28-187.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_12-40-28-187.csv Completed graceful shutdown