java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:35:15,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:35:15,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:35:15,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:35:15,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:35:15,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:35:15,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:35:15,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:35:15,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:35:15,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:35:15,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:35:15,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:35:15,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:35:15,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:35:15,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:35:15,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:35:15,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:35:15,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:35:15,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:35:15,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:35:15,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:35:15,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:35:15,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:35:15,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:35:15,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:35:15,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:35:15,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:35:15,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:35:15,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:35:15,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:35:15,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:35:15,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:35:15,932 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:35:15,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:35:15,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:35:15,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:35:15,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:35:15,950 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:35:15,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:35:15,951 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:35:15,951 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:35:15,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:35:15,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:35:15,952 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:35:15,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:35:15,953 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:35:15,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:35:15,953 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:35:15,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:35:15,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:35:15,954 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:35:15,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:35:15,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:35:15,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:35:15,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:35:15,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:35:15,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:35:15,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:35:15,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:35:15,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:35:15,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:35:15,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:35:15,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:35:15,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:35:15,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:35:15,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:35:15,959 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:35:15,959 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:35:16,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:35:16,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:35:16,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:35:16,026 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:35:16,026 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:35:16,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-10-04 14:35:16,027 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-10-04 14:35:16,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:35:16,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:35:16,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:35:16,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:35:16,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:35:16,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,123 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:35:16,124 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:35:16,124 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:35:16,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:35:16,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:35:16,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:35:16,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:35:16,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/1) ... [2018-10-04 14:35:16,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:35:16,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:35:16,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:35:16,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:35:16,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (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 14:35:16,222 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 14:35:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 14:35:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 14:35:16,406 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:35:16,407 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:35:16 BoogieIcfgContainer [2018-10-04 14:35:16,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:35:16,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:35:16,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:35:16,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:35:16,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:35:16" (1/2) ... [2018-10-04 14:35:16,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d1d5e2 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:35:16, skipping insertion in model container [2018-10-04 14:35:16,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:35:16" (2/2) ... [2018-10-04 14:35:16,415 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-10-04 14:35:16,426 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:35:16,437 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:35:16,487 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:35:16,488 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:35:16,488 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:35:16,488 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:35:16,489 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:35:16,489 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:35:16,489 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:35:16,489 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:35:16,489 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:35:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 14:35:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:35:16,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:16,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:35:16,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:16,518 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-10-04 14:35:16,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:16,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:16,666 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 14:35:16,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:35:16,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:35:16,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:35:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:35:16,686 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:16,688 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 14:35:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:16,749 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-10-04 14:35:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:35:16,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:35:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:16,780 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:35:16,784 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:35:16,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:35:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:35:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 14:35:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:35:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 14:35:16,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 14:35:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:16,839 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 14:35:16,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:35:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 14:35:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:35:16,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:16,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:35:16,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:16,841 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 28755491, now seen corresponding path program 1 times [2018-10-04 14:35:16,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:16,930 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 14:35:16,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:16,930 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:16,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:17,047 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 14:35:17,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:17,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:35:17,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:35:17,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:35:17,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:17,083 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 14:35:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,207 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 14:35:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:35:17,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 14:35:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,208 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:35:17,208 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:35:17,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:35:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:35:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-10-04 14:35:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:35:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 14:35:17,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 14:35:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,213 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 14:35:17,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:35:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 14:35:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:35:17,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:35:17,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash 28757413, now seen corresponding path program 1 times [2018-10-04 14:35:17,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,332 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 14:35:17,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:17,333 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 14:35:17,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:17,390 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 14:35:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:17,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:35:17,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:35:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:35:17,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:17,414 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-10-04 14:35:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,464 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-10-04 14:35:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:35:17,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 14:35:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,466 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:35:17,466 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:35:17,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:35:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:35:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-10-04 14:35:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:35:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 14:35:17,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 14:35:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,471 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 14:35:17,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:35:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 14:35:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:35:17,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 14:35:17,472 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,472 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1863917926, now seen corresponding path program 2 times [2018-10-04 14:35:17,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:17,567 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 14:35:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:17,601 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:17,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:17,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:17,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:35:17,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:35:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:35:17,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:17,687 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-10-04 14:35:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:17,726 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 14:35:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:35:17,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 14:35:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:17,728 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:35:17,728 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:35:17,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:35:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:35:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 14:35:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:35:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 14:35:17,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 14:35:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:17,733 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 14:35:17,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:35:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 14:35:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:35:17,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:17,733 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:35:17,734 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:17,734 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919848, now seen corresponding path program 1 times [2018-10-04 14:35:17,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:17,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:17,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:17,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:17,926 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) [2018-10-04 14:35:17,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:17,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:35:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:35:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:35:18,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,037 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 14:35:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:18,079 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 14:35:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:35:18,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 14:35:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:18,081 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:35:18,081 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:35:18,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 14:35:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:35:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 14:35:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:35:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 14:35:18,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 14:35:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:18,086 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 14:35:18,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:35:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 14:35:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:35:18,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:18,087 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:35:18,087 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:18,087 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1865764968, now seen corresponding path program 2 times [2018-10-04 14:35:18,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:18,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:18,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:18,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:18,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:18,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:35:18,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:35:18,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:35:18,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,249 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 14:35:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:18,284 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-10-04 14:35:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:35:18,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 14:35:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:18,286 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:35:18,286 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:35:18,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:35:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:35:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-10-04 14:35:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:35:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 14:35:18,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2018-10-04 14:35:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 14:35:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:35:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 14:35:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:35:18,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:18,292 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 14:35:18,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:18,293 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766890, now seen corresponding path program 2 times [2018-10-04 14:35:18,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,339 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 14:35:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:18,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:18,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:35:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:35:18,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:35:18,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,491 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2018-10-04 14:35:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:18,524 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-10-04 14:35:18,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:35:18,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 14:35:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:18,526 INFO L225 Difference]: With dead ends: 16 [2018-10-04 14:35:18,526 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:35:18,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:35:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:35:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-10-04 14:35:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:35:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 14:35:18,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 14:35:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:18,532 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 14:35:18,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:35:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 14:35:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:18,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:18,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 14:35:18,533 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:18,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash 223459305, now seen corresponding path program 3 times [2018-10-04 14:35:18,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:18,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:18,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:18,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,606 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 14:35:18,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:18,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:35:18,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:18,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:18,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:18,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,684 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2018-10-04 14:35:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:18,757 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 14:35:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:18,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:18,758 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:35:18,758 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:35:18,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:35:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:35:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 14:35:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:18,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 14:35:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:18,765 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:18,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:18,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:18,766 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:18,766 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:18,766 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash 223461227, now seen corresponding path program 3 times [2018-10-04 14:35:18,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:18,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:18,840 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 14:35:18,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:18,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:35:18,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:18,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:18,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:18,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:18,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:18,922 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:18,922 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 14:35:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:19,077 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 14:35:19,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:19,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:19,079 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:35:19,079 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:35:19,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:35:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:35:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 14:35:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:35:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 14:35:19,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 14:35:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:19,086 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 14:35:19,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 14:35:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:19,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:19,087 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:19,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:19,087 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 225306347, now seen corresponding path program 4 times [2018-10-04 14:35:19,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:19,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:19,466 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:19,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:19,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:19,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:19,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:19,513 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 14:35:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:19,552 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 14:35:19,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:19,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:19,553 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:35:19,553 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:35:19,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 14:35:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:35:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 14:35:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:19,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 14:35:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:19,560 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:19,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:19,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:19,561 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:19,561 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:19,561 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash 225308269, now seen corresponding path program 5 times [2018-10-04 14:35:19,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:19,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:19,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:19,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:19,618 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 14:35:19,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:19,633 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:35:19,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:19,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:19,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:19,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:19,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:19,686 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:19,686 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 14:35:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:19,706 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 14:35:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:19,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:19,708 INFO L225 Difference]: With dead ends: 18 [2018-10-04 14:35:19,709 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:35:19,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:35:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:35:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 14:35:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:35:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 14:35:19,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 14:35:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:19,713 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 14:35:19,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 14:35:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:19,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:19,715 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:19,715 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:19,715 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1998466667, now seen corresponding path program 6 times [2018-10-04 14:35:19,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:19,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:19,769 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 14:35:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:19,805 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:35:19,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:19,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:19,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:19,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:19,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:19,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:19,894 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 14:35:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:19,924 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 14:35:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:19,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:19,925 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:35:19,925 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:35:19,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:35:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:35:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-10-04 14:35:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:19,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 14:35:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:19,931 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:19,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:19,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:19,932 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:19,933 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:19,933 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1998468589, now seen corresponding path program 7 times [2018-10-04 14:35:19,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:19,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:20,007 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 14:35:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:20,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:20,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:20,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:20,075 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 14:35:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:20,122 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 14:35:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:20,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:20,123 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:35:20,123 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:35:20,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:35:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:35:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-10-04 14:35:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:20,130 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 14:35:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:20,130 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:20,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:20,131 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:35:20,131 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:20,131 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313709, now seen corresponding path program 8 times [2018-10-04 14:35:20,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:20,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:20,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:20,371 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:20,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:20,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:20,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:20,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:20,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:20,433 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 14:35:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:20,474 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-10-04 14:35:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:20,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:20,480 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:35:20,480 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:35:20,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:35:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:35:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-04 14:35:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:20,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 14:35:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:20,485 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:35:20,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:20,486 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 14:35:20,486 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:20,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2000315631, now seen corresponding path program 3 times [2018-10-04 14:35:20,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:20,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:20,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:20,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:20,560 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 14:35:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:20,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:35:20,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:20,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:20,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:35:20,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:35:20,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:35:20,645 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:20,646 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 14:35:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:20,699 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-10-04 14:35:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:35:20,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 14:35:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:20,702 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:35:20,702 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 14:35:20,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:35:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 14:35:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-10-04 14:35:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:35:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 14:35:20,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 14:35:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:20,708 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 14:35:20,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:35:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 14:35:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:20,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:20,709 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 14:35:20,709 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:20,709 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash -4277844, now seen corresponding path program 4 times [2018-10-04 14:35:20,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:20,818 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 14:35:20,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:20,833 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:20,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:20,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:20,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:20,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:20,953 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:20,953 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-10-04 14:35:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:20,993 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 14:35:20,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:20,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:20,994 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:35:20,994 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:35:20,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:35:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 14:35:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:21,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,002 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:21,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:21,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,003 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:21,003 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,003 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash -4275922, now seen corresponding path program 9 times [2018-10-04 14:35:21,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,107 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 14:35:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:21,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 14:35:21,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:21,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:21,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:21,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:21,172 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,211 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 14:35:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:21,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,213 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:35:21,213 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:35:21,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:35:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 14:35:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:21,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 14:35:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,221 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:21,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:21,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,222 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:21,223 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,223 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2430802, now seen corresponding path program 10 times [2018-10-04 14:35:21,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:21,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:21,297 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:21,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:21,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:21,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:21,368 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:21,368 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 14:35:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,434 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 14:35:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:21,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,435 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:35:21,435 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:35:21,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:35:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 14:35:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:21,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,444 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:21,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:21,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,445 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:21,446 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2428880, now seen corresponding path program 11 times [2018-10-04 14:35:21,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:21,578 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 14:35:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:21,600 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 14:35:21,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:21,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:21,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:21,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:21,698 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:21,892 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 14:35:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:21,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:21,893 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:35:21,893 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:35:21,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:35:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 14:35:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:21,899 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 14:35:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:21,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:21,900 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:21,900 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:21,900 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1770729518, now seen corresponding path program 12 times [2018-10-04 14:35:21,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:22,001 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 14:35:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:22,017 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 14:35:22,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:22,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:22,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:22,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:22,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:22,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:22,065 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 14:35:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:22,203 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 14:35:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:22,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:22,204 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:35:22,204 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:35:22,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:35:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 14:35:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:22,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:22,214 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:22,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:22,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:22,215 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:22,215 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:22,216 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1770731440, now seen corresponding path program 13 times [2018-10-04 14:35:22,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:22,277 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 14:35:22,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:22,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:22,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:22,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:22,413 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:22,413 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:22,457 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 14:35:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:22,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:22,458 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:35:22,458 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:35:22,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:35:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 14:35:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:22,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 14:35:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:22,465 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:22,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:22,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:22,466 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:22,466 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:22,466 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1772576560, now seen corresponding path program 14 times [2018-10-04 14:35:22,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:22,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 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 14:35:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:22,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:22,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:22,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:22,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:22,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:22,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:22,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:22,590 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 14:35:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:22,757 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 14:35:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:22,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:22,761 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:35:22,761 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:35:22,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:35:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 14:35:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:22,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:22,771 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:22,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:22,772 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:22,773 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:22,773 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1772578482, now seen corresponding path program 15 times [2018-10-04 14:35:22,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:23,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 14:35:23,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:23,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:23,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:23,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:23,251 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:23,362 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 14:35:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:23,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:23,363 INFO L225 Difference]: With dead ends: 22 [2018-10-04 14:35:23,363 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:35:23,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 5 [2018-10-04 14:35:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:35:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 14:35:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:23,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 14:35:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:23,369 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:23,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:23,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:23,370 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:23,370 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:23,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:23,371 INFO L82 PathProgramCache]: Analyzing trace with hash 675780526, now seen corresponding path program 16 times [2018-10-04 14:35:23,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:23,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:23,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:23,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,418 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 14:35:23,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:23,455 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:23,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:23,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:23,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:23,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:23,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:23,608 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:23,609 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 14:35:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:23,682 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:23,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:23,683 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:23,683 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:23,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 14:35:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:23,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 14:35:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:23,692 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:23,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:23,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:23,693 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:23,693 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:23,693 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 675782448, now seen corresponding path program 17 times [2018-10-04 14:35:23,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:23,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:23,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:23,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,765 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 14:35:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:23,778 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 14:35:23,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:23,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:23,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:23,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:23,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:23,830 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 14:35:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:23,888 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:23,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:23,889 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:23,889 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:23,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-10-04 14:35:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:23,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:23,898 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:23,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:23,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:23,899 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:23,899 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:23,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 677627568, now seen corresponding path program 18 times [2018-10-04 14:35:23,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:23,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:23,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:23,952 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 14:35:23,966 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:23,977 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 14:35:23,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:23,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:24,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:24,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,081 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,105 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:24,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,106 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:24,106 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:24,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 14:35:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:24,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 14:35:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,117 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:24,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:24,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,118 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:24,118 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,118 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 677629490, now seen corresponding path program 19 times [2018-10-04 14:35:24,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:24,174 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 14:35:24,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:24,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:24,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:24,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,249 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 14:35:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,284 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:24,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:24,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,285 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:24,285 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:24,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-10-04 14:35:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:24,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 14:35:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,293 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:24,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:24,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,294 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 14:35:24,294 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1844179408, now seen corresponding path program 20 times [2018-10-04 14:35:24,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:24,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:24,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:24,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:24,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:24,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:24,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,403 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 14:35:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,431 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 14:35:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:24,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,432 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:35:24,432 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:35:24,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:35:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-04 14:35:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:24,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 14:35:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,444 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:24,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:24,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,445 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:24,445 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,445 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1844177486, now seen corresponding path program 21 times [2018-10-04 14:35:24,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:24,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:24,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:24,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 14:35:24,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:24,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:24,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:24,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,602 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 14:35:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,647 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 14:35:24,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:24,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,648 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:35:24,649 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:35:24,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:35:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:35:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-10-04 14:35:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:24,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 14:35:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,660 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:24,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:24,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,661 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:35:24,661 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,662 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1842332366, now seen corresponding path program 22 times [2018-10-04 14:35:24,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:24,857 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 14:35:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:24,872 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:24,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:24,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:24,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:24,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:24,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:24,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:24,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:24,916 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 14:35:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:24,964 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 14:35:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:24,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:24,965 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:35:24,965 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:35:24,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 14:35:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:35:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-04 14:35:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:24,975 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 14:35:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:35:24,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:24,976 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 14:35:24,976 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:24,977 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1842330444, now seen corresponding path program 4 times [2018-10-04 14:35:24,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:24,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:25,026 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 14:35:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:25,042 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:25,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:25,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:25,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:35:25,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:35:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:35:25,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:25,176 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 14:35:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:25,222 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-10-04 14:35:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:35:25,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:35:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:25,223 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:35:25,223 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:35:25,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:35:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:35:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-10-04 14:35:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:35:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 14:35:25,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 14:35:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:25,229 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 14:35:25,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:35:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 14:35:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:25,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:25,230 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 14:35:25,230 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:25,230 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 183654063, now seen corresponding path program 5 times [2018-10-04 14:35:25,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:25,312 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 14:35:25,320 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:25,394 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:25,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:25,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:25,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:25,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:25,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:25,592 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2018-10-04 14:35:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:25,632 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:25,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:25,633 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:25,633 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:25,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 14:35:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 14:35:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:25,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:25,646 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:25,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:25,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:25,646 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:25,646 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:25,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash 183655985, now seen corresponding path program 23 times [2018-10-04 14:35:25,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:25,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:25,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:25,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:25,698 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:25,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:25,713 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:25,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:25,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:25,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:25,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:25,790 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:25,827 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:25,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:25,828 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:25,828 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:25,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 14:35:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:25,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:25,842 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:25,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:25,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:25,843 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:25,843 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:25,843 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash 185501105, now seen corresponding path program 24 times [2018-10-04 14:35:25,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:25,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:25,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:25,935 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 14:35:25,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:25,951 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 14:35:25,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:25,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:26,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:26,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:26,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:26,023 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:26,219 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:26,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:26,220 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:26,220 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:26,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 14:35:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:26,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:26,234 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:26,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:26,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:26,236 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:26,236 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:26,236 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash 185503027, now seen corresponding path program 25 times [2018-10-04 14:35:26,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:26,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:26,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:26,291 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 14:35:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:26,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:26,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:26,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:26,383 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:26,416 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:26,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:26,417 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:26,418 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:26,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 14:35:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:26,427 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 14:35:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:26,427 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:26,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:26,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:26,428 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:26,428 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:26,428 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1958661425, now seen corresponding path program 26 times [2018-10-04 14:35:26,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:26,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:26,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:26,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:26,532 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 14:35:26,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:26,545 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:26,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:26,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:26,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:26,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:26,589 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:26,589 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 14:35:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:26,622 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:26,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:26,623 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:26,623 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:26,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 14:35:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:26,637 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:26,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:26,638 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:26,638 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:26,638 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1958663347, now seen corresponding path program 27 times [2018-10-04 14:35:26,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:26,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:26,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:26,710 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 14:35:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:26,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:35:26,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:26,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:26,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:26,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:26,789 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:26,820 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:26,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:26,821 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:26,821 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:26,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 14:35:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:26,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:26,834 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:26,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:26,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:26,834 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:26,834 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:26,835 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1960508467, now seen corresponding path program 28 times [2018-10-04 14:35:26,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:26,908 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 14:35:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:26,928 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:26,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:26,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:26,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:26,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:26,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:26,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:26,982 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,045 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 14:35:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:27,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,046 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:35:27,046 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:35:27,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:35:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 14:35:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:27,067 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,067 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:27,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:27,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,068 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:27,068 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,069 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510389, now seen corresponding path program 29 times [2018-10-04 14:35:27,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:27,145 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 14:35:27,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:27,160 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:27,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:27,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:27,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:27,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:27,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:27,242 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,281 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 14:35:27,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:27,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,282 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:35:27,282 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:35:27,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:35:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 14:35:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:27,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 14:35:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,297 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:27,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:27,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,297 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:27,298 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,298 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash 863712433, now seen corresponding path program 30 times [2018-10-04 14:35:27,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:27,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:27,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:35:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:27,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 14:35:27,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:27,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:27,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:27,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:27,470 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 14:35:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,537 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:27,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:27,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,537 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:27,538 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:27,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 14:35:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:27,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,553 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:27,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:27,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,554 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:27,554 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,554 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash 863714355, now seen corresponding path program 31 times [2018-10-04 14:35:27,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:27,611 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 14:35:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:27,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:27,674 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:27,882 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:27,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:27,883 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:27,883 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:27,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 14:35:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:27,896 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:27,896 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:27,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:27,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:27,897 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:27,897 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:27,897 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 865559475, now seen corresponding path program 32 times [2018-10-04 14:35:27,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:27,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:27,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:27,963 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 14:35:27,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:27,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:27,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:27,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:28,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:28,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:28,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:28,084 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:28,166 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:28,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:28,167 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:28,167 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:28,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 14:35:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:28,186 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:28,186 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:28,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:28,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:28,186 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:28,187 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:28,187 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 865561397, now seen corresponding path program 33 times [2018-10-04 14:35:28,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:28,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:28,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:28,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:28,242 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 14:35:28,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:28,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:35:28,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:28,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:28,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:28,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:28,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:28,312 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:28,365 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:28,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:28,365 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:28,365 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:28,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 14:35:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:28,377 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 14:35:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:28,377 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:28,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:28,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:28,378 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:28,378 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:28,378 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1656247501, now seen corresponding path program 34 times [2018-10-04 14:35:28,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:28,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:28,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:28,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,013 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 14:35:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:29,027 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:29,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:29,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:29,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:29,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:29,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,071 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 14:35:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,112 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:29,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,113 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:29,113 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:29,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 6 [2018-10-04 14:35:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 14:35:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:29,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:29,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,131 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:29,132 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,132 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1656245579, now seen corresponding path program 35 times [2018-10-04 14:35:29,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,273 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:29,287 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:29,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:29,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:29,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:29,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,325 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,357 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:29,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,358 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:29,358 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:29,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 14:35:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:29,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,373 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:29,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:29,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,373 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:29,373 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,373 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1654400459, now seen corresponding path program 36 times [2018-10-04 14:35:29,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,422 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:29,437 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 14:35:29,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:29,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:29,497 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,497 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,534 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 14:35:29,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:29,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,535 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:35:29,535 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:35:29,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:35:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 14:35:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:29,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,552 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:29,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:29,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,552 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:29,553 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,553 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1654398537, now seen corresponding path program 37 times [2018-10-04 14:35:29,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:29,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:29,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,693 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,758 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 14:35:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:29,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,759 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:35:29,759 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:35:29,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:35:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 14:35:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:29,770 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 14:35:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,770 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:29,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:29,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,771 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:29,771 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash 884718641, now seen corresponding path program 38 times [2018-10-04 14:35:29,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:29,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:29,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:29,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:29,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:29,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:29,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:29,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:29,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:29,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:29,918 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 14:35:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:29,969 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:29,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:29,970 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:29,970 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:29,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 14:35:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:29,991 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:29,991 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:29,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:29,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:29,991 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:29,992 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:29,992 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 884720563, now seen corresponding path program 39 times [2018-10-04 14:35:29,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:29,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:30,062 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:35:30,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:30,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:30,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:30,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:30,118 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:30,178 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:30,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:30,179 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:30,179 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:30,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 14:35:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:30,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:30,198 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:30,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:30,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:30,199 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:30,199 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:30,199 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash 886565683, now seen corresponding path program 40 times [2018-10-04 14:35:30,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:30,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:30,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:30,301 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:30,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:30,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:30,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:30,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:30,361 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:30,423 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:30,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:30,424 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:30,424 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:30,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 14:35:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:30,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:30,443 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:30,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:30,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:30,444 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:30,444 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:30,444 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 886567605, now seen corresponding path program 41 times [2018-10-04 14:35:30,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:30,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:30,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:30,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:30,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:30,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:30,674 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:30,720 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:30,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:30,721 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:30,721 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:30,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-10-04 14:35:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:30,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:30,738 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:30,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:30,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:30,739 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:30,739 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:30,739 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1635241293, now seen corresponding path program 42 times [2018-10-04 14:35:30,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:30,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:30,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:30,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:30,814 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 14:35:30,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:30,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:30,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:30,871 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:30,871 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:30,921 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:30,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:30,922 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:30,922 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:30,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 14:35:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:30,943 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:30,943 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:30,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:30,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:30,944 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:30,944 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:30,944 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1635239371, now seen corresponding path program 43 times [2018-10-04 14:35:30,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:30,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:31,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:31,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:31,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:31,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:31,088 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:31,203 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:31,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:31,204 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:31,204 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:31,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 14:35:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:31,224 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:31,224 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:31,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:31,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:31,224 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:31,224 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:31,225 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1633394251, now seen corresponding path program 44 times [2018-10-04 14:35:31,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:31,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:31,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:31,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:31,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:31,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:31,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:31,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:31,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:31,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:31,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:31,335 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:31,385 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:31,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:31,386 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:31,386 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:31,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 14:35:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:31,409 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:31,409 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:31,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:31,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:31,409 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:31,409 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:31,409 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:31,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1633392329, now seen corresponding path program 45 times [2018-10-04 14:35:31,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:31,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:31,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:31,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:31,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:31,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:35:31,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:31,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:31,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:31,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:31,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:31,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:31,528 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:31,581 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:31,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:31,582 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:31,582 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:31,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-10-04 14:35:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:31,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 14:35:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:31,600 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:31,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:31,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:31,600 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:31,600 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:31,601 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1564777011, now seen corresponding path program 46 times [2018-10-04 14:35:31,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:31,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:31,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:31,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:31,704 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:31,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:31,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:31,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:31,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:31,755 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 14:35:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:31,813 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:31,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:31,813 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:31,813 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:31,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 14:35:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:31,837 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:31,837 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:31,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:31,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:31,838 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:31,838 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:31,838 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1564778933, now seen corresponding path program 47 times [2018-10-04 14:35:31,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:31,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:31,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:31,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:31,895 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:31,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:31,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:31,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:31,961 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:31,962 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,022 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:32,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,023 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:32,023 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:32,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 14:35:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:32,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,048 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:32,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:32,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,048 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:32,048 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1566624053, now seen corresponding path program 48 times [2018-10-04 14:35:32,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:32,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:32,111 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:32,118 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 14:35:32,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:32,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:32,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:32,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,178 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,247 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:32,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,249 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:32,249 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:32,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 14:35:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:32,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,276 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:32,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:32,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,276 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:32,276 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,277 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1566625975, now seen corresponding path program 49 times [2018-10-04 14:35:32,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:32,358 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:32,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:32,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:32,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:32,441 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,441 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,584 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:32,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,585 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:32,585 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:32,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:35:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-04 14:35:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:32,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 14:35:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,617 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:32,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:32,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,617 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 14:35:32,618 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,618 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash -955182923, now seen corresponding path program 50 times [2018-10-04 14:35:32,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:32,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:32,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:32,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:32,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:32,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:32,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:32,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,769 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 14:35:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:32,822 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:32,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:32,823 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:32,823 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:32,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-04 14:35:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:32,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:32,847 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:32,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:32,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:32,848 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:32,848 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:32,848 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash -955181001, now seen corresponding path program 51 times [2018-10-04 14:35:32,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:32,894 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:32,909 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:35:32,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:32,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:32,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:32,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:32,962 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:33,005 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:33,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:33,006 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:33,006 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:33,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-10-04 14:35:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:33,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 14:35:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:33,030 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:33,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:33,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:33,031 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:35:33,031 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:33,031 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash -953335881, now seen corresponding path program 52 times [2018-10-04 14:35:33,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,080 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:33,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:33,121 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:33,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:33,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:33,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:33,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:33,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:33,180 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 14:35:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:33,229 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 14:35:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:33,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:33,230 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:35:33,230 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:35:33,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:35:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-10-04 14:35:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:33,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 14:35:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:33,254 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:33,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:35:33,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:33,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 14:35:33,255 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:33,255 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -953333959, now seen corresponding path program 5 times [2018-10-04 14:35:33,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:33,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:33,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,301 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:33,311 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:33,321 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:35:33,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:33,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:33,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:33,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:35:33,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:35:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:35:33,367 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:33,367 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 14:35:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:33,420 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-10-04 14:35:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:35:33,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 14:35:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:33,421 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:35:33,421 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:35:33,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 14:35:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:35:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-10-04 14:35:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:35:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 14:35:33,441 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 14:35:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:33,441 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 14:35:33,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:35:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 14:35:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:33,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:33,441 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 14:35:33,441 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:33,442 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash 397590258, now seen corresponding path program 6 times [2018-10-04 14:35:33,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:33,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:33,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:33,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,501 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 14:35:33,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,501 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:33,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:33,525 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:33,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:33,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:33,564 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 14:35:33,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:33,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:33,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:33,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:33,588 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2018-10-04 14:35:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:33,671 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:33,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:33,672 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:33,672 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:33,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:35:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:33,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:33,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:33,706 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:33,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:33,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:33,707 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:33,707 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:33,708 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 397592180, now seen corresponding path program 53 times [2018-10-04 14:35:33,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:33,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:33,779 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 14:35:33,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:33,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:33,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:33,793 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:33,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:33,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:33,834 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 14:35:33,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:33,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:33,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:33,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:33,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:33,855 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:33,935 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:33,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:33,936 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:33,936 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:33,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:35:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:33,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:33,966 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:33,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:33,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:33,967 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:33,967 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:33,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 399437300, now seen corresponding path program 54 times [2018-10-04 14:35:33,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,023 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 14:35:34,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:34,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:34,031 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:34,043 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:34,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:34,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,103 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 14:35:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:34,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:34,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,123 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,215 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:34,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:34,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,216 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:34,216 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:34,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:35:34,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:34,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:34,250 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:34,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:34,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:34,250 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:34,250 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:34,250 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash 399439222, now seen corresponding path program 55 times [2018-10-04 14:35:34,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,302 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 14:35:34,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:34,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:34,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,358 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 14:35:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:34,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,378 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,454 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:34,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,455 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:34,455 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:34,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 14:35:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:34,483 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:34,483 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:34,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:34,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:34,483 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:34,483 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:34,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2122369676, now seen corresponding path program 56 times [2018-10-04 14:35:34,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,554 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 14:35:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:34,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:34,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:34,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:34,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:34,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,612 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 14:35:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:34,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:34,633 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,633 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,716 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:34,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,717 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:34,717 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:34,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:35:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:34,752 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:34,752 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:34,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:34,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:34,753 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:34,753 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:34,753 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2122367754, now seen corresponding path program 57 times [2018-10-04 14:35:34,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:34,818 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 14:35:34,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:34,819 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:34,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:34,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:34,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:34,873 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 14:35:34,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:34,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:34,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:34,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:34,895 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:34,981 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:34,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:34,982 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:34,982 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:34,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:35:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:35,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:35,016 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:35,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:35,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:35,017 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:35,017 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:35,017 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2120522634, now seen corresponding path program 58 times [2018-10-04 14:35:35,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:35,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:35,113 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 14:35:35,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:35,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:35,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:35,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:35,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:35,174 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 14:35:35,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:35,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:35,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:35,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:35,198 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:35,287 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:35,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:35,288 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:35,288 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:35,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:35:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:35,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:35,322 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:35,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:35,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:35,323 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:35,323 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:35,323 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520712, now seen corresponding path program 59 times [2018-10-04 14:35:35,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:35,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:35,401 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 14:35:35,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:35,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:35,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:35,421 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:35,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:35,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:35,492 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 14:35:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:35,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:35,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:35,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:35,512 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:35,513 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:35,607 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:35,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:35,608 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:35,608 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:35,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 14:35:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:35,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 14:35:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:35,633 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:35,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:35,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:35,633 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:35,633 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:35,633 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1077648628, now seen corresponding path program 60 times [2018-10-04 14:35:35,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:35,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:35,719 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 14:35:35,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:35,719 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:35,735 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:35,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:35,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:35,756 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 14:35:35,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:35,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:35,780 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:35,781 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 14:35:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:35,867 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:35,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:35,868 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:35,868 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:35,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 14:35:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:35,900 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:35,900 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:35,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:35,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:35,900 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:35,901 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:35,901 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1077650550, now seen corresponding path program 61 times [2018-10-04 14:35:35,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,034 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 14:35:36,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:36,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:36,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:36,085 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 14:35:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:36,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:36,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:36,106 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:36,106 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:36,182 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:36,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:36,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:36,183 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:36,183 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:36,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 14:35:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:36,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:36,217 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:36,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:36,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:36,218 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:36,218 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:36,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1079495670, now seen corresponding path program 62 times [2018-10-04 14:35:36,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,273 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 14:35:36,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:36,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:36,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:36,288 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:36,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:36,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:36,315 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 14:35:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:36,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:36,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:36,337 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:36,423 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:36,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:36,425 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:36,425 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:36,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 14:35:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:36,466 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:36,466 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:36,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:36,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:36,466 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:36,467 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:36,467 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1079497592, now seen corresponding path program 63 times [2018-10-04 14:35:36,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,556 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 14:35:36,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:36,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:36,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:36,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:36,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:36,614 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 14:35:36,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:36,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:36,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:36,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:36,635 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:36,724 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:36,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:36,725 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:36,725 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:36,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 14:35:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:36,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:36,757 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:36,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:36,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:36,758 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:36,758 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:36,758 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:36,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1442311306, now seen corresponding path program 64 times [2018-10-04 14:35:36,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:36,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:36,977 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 14:35:36,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:36,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:36,991 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:36,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:36,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:37,013 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 14:35:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:37,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:37,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:37,035 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:37,035 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,113 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:37,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:37,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,114 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:37,114 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:37,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:35:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 14:35:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:37,151 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:37,151 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:37,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:37,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:37,152 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:37,152 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:37,152 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1442309384, now seen corresponding path program 65 times [2018-10-04 14:35:37,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:37,235 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 14:35:37,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:37,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:37,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:37,251 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:37,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:37,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:37,284 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 14:35:37,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:37,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:37,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:37,306 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,372 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:37,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,373 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:37,373 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:37,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 14:35:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:37,406 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:37,406 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:37,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:37,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:37,407 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:37,407 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:37,407 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1440464264, now seen corresponding path program 66 times [2018-10-04 14:35:37,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:37,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:37,604 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 14:35:37,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:37,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:37,618 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:37,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:37,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:37,678 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 14:35:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:37,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:37,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:37,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:37,700 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,765 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:37,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,766 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:37,766 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:37,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:35:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 14:35:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:37,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:37,803 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:37,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:37,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:37,804 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:37,804 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:37,804 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1440462342, now seen corresponding path program 67 times [2018-10-04 14:35:37,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:37,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:37,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:37,856 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 14:35:37,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:37,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:37,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:37,910 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 14:35:37,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:37,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:37,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:37,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:37,930 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:37,990 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 14:35:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:37,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:37,991 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:35:37,991 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:35:37,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:35:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 14:35:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:38,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 14:35:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:38,016 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:38,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:38,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:38,017 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:38,017 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:38,017 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1098654836, now seen corresponding path program 68 times [2018-10-04 14:35:38,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:38,102 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 14:35:38,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:38,102 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:38,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:38,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:38,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:38,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:38,135 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 14:35:38,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:38,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:38,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:38,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:38,157 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 14:35:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:38,263 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:38,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:38,264 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:38,264 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:38,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:35:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:38,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:38,307 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:38,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:38,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:38,307 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:38,308 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:38,308 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1098656758, now seen corresponding path program 69 times [2018-10-04 14:35:38,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,092 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 14:35:39,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:39,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:39,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:39,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,141 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 14:35:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:39,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:39,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,163 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:39,263 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:39,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:39,264 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:39,264 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:39,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 7 [2018-10-04 14:35:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:35:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:39,305 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:39,305 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:39,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:39,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:39,306 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:39,306 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:39,306 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1100501878, now seen corresponding path program 70 times [2018-10-04 14:35:39,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,353 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 14:35:39,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,354 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:39,366 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:39,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,398 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 14:35:39,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:39,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:39,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,421 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:39,522 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:39,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:39,523 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:39,523 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:39,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:35:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:39,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:39,567 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:39,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:39,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:39,567 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:39,567 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:39,567 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1100503800, now seen corresponding path program 71 times [2018-10-04 14:35:39,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:39,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,624 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 14:35:39,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:39,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:39,649 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:39,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,693 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 14:35:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:39,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:39,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,714 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:39,813 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:39,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:39,814 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:39,814 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:39,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 14:35:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:39,851 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:39,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:39,852 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:39,852 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:39,852 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1421305098, now seen corresponding path program 72 times [2018-10-04 14:35:39,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:39,934 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 14:35:39,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:39,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:39,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:39,950 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:39,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:39,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:39,977 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 14:35:39,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:39,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:39,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:39,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:39,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:39,999 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:40,108 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:40,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:40,109 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:40,109 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:40,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:35:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:40,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:40,156 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:40,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:40,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:40,157 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:40,157 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:40,157 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1421303176, now seen corresponding path program 73 times [2018-10-04 14:35:40,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:40,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,236 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 14:35:40,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:40,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:40,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:40,279 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 14:35:40,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:40,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:40,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:40,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:40,301 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:40,407 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:40,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:40,408 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:40,408 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:40,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:35:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:40,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:40,452 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:40,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:40,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:40,452 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:40,453 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:40,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:40,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1419458056, now seen corresponding path program 74 times [2018-10-04 14:35:40,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:40,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:40,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,566 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 14:35:40,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:40,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:40,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:40,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:40,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:40,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:40,641 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 14:35:40,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:40,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:40,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:40,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:40,661 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:40,662 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:40,764 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:40,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:40,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:40,765 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:40,765 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:40,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:35:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:40,809 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:40,810 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:40,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:40,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:40,810 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:40,810 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:40,811 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1419456134, now seen corresponding path program 75 times [2018-10-04 14:35:40,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:40,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:40,902 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 14:35:40,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:40,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:40,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:40,918 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:40,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:40,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:40,938 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 14:35:40,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:40,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:40,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:40,959 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:41,057 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:41,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:41,058 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:41,058 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:41,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 14:35:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:41,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 14:35:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:41,092 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:41,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:41,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:41,092 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:41,092 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:41,092 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1778713206, now seen corresponding path program 76 times [2018-10-04 14:35:41,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:41,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:41,144 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 14:35:41,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:41,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:41,159 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:41,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:41,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:41,202 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 14:35:41,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:41,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:41,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:41,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:41,223 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 14:35:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:41,324 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:41,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:41,325 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:41,325 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:41,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 14:35:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:41,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:41,370 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:41,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:41,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:41,371 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:41,371 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:41,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1778715128, now seen corresponding path program 77 times [2018-10-04 14:35:41,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:41,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:41,432 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 14:35:41,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:41,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:41,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:41,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:41,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:41,514 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 14:35:41,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:41,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:41,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:41,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:41,535 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:41,630 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:41,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:41,631 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:41,631 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:41,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 14:35:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:41,681 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:41,681 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:41,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:41,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:41,681 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:41,682 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:41,682 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1780560248, now seen corresponding path program 78 times [2018-10-04 14:35:41,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:41,753 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 14:35:41,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:41,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:41,781 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:41,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:41,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:41,821 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 14:35:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:41,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:41,842 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:41,945 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:41,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:41,946 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:41,946 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:41,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 14:35:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:42,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:42,013 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:42,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:42,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:42,014 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:42,014 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:42,014 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1780562170, now seen corresponding path program 79 times [2018-10-04 14:35:42,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:42,154 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 14:35:42,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:42,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:42,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:42,203 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 14:35:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:42,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:42,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:42,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:42,223 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:42,330 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:42,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:42,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:42,331 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:42,331 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:42,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 14:35:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:42,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:42,371 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:42,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:42,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:42,371 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:42,371 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:42,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash -741246728, now seen corresponding path program 80 times [2018-10-04 14:35:42,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:42,427 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 14:35:42,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:42,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:42,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:42,441 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:42,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:42,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:42,478 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 14:35:42,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:42,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:42,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:42,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:42,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:42,499 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:42,587 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:42,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:42,588 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:42,588 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:42,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 14:35:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:42,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:42,639 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:42,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:42,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:42,639 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:42,639 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:42,639 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -741244806, now seen corresponding path program 81 times [2018-10-04 14:35:42,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:42,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:42,868 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 14:35:42,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:42,869 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:42,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:42,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:42,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:42,904 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 14:35:42,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:42,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:42,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:42,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:42,926 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:43,012 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:43,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:43,013 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:43,013 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:43,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:35:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 14:35:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:43,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:43,057 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:43,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:43,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:43,057 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:43,057 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:43,057 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -739399686, now seen corresponding path program 82 times [2018-10-04 14:35:43,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:43,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:43,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,117 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 14:35:43,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,117 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:43,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:43,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:43,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:43,161 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 14:35:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:43,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:43,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:43,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:43,183 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:43,265 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 14:35:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:43,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:43,266 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:35:43,266 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:35:43,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:35:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 14:35:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:43,309 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:43,309 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:43,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:43,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:43,310 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:43,310 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:43,310 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -739397764, now seen corresponding path program 83 times [2018-10-04 14:35:43,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:43,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,372 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 14:35:43,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:43,388 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:43,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:43,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:43,410 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 14:35:43,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:43,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:43,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:43,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:43,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:43,432 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:43,519 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 14:35:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:43,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:43,520 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:35:43,520 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 14:35:43,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 14:35:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 14:35:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:43,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 14:35:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:43,549 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:43,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:43,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:43,549 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:43,550 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:43,550 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -189215756, now seen corresponding path program 84 times [2018-10-04 14:35:43,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,620 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 14:35:43,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:43,639 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:43,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:43,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:43,677 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 14:35:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:43,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:43,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:43,699 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 14:35:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:43,837 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:35:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:43,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:43,838 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:35:43,838 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:35:43,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:35:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:35:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:43,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:43,895 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:43,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:43,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:43,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:43,895 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:43,895 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:43,896 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -189213834, now seen corresponding path program 85 times [2018-10-04 14:35:43,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:43,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:43,991 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 14:35:43,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:43,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:44,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:44,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:44,025 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 14:35:44,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:44,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:44,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:44,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:44,047 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:44,190 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:35:44,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:44,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:44,191 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:35:44,191 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:35:44,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:35:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 14:35:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:44,245 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:44,246 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:44,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:44,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:44,246 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:44,246 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:44,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:44,247 INFO L82 PathProgramCache]: Analyzing trace with hash -187368714, now seen corresponding path program 86 times [2018-10-04 14:35:44,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:44,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:44,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:44,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:44,330 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 14:35:44,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:44,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:44,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:44,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:44,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:44,381 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 14:35:44,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:44,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:44,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:44,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:44,402 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:44,549 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:35:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:44,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:44,550 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:35:44,550 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:35:44,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:35:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:35:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:44,608 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:44,608 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:44,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:44,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:44,609 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:44,609 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:44,609 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash -187366792, now seen corresponding path program 87 times [2018-10-04 14:35:44,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:44,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:44,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:44,661 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 14:35:44,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:44,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:44,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:44,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:44,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:44,705 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 14:35:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:44,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:44,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:44,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:44,727 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:44,922 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:35:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:44,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:44,923 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:35:44,923 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:35:44,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:35:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 14:35:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:45,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:45,003 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:45,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:45,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:45,003 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:45,004 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:45,004 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1585791606, now seen corresponding path program 88 times [2018-10-04 14:35:45,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:45,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:45,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:45,695 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 14:35:45,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:45,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:45,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:45,744 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:45,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:45,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:46,168 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 14:35:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:46,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:46,205 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:46,697 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:35:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:46,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:46,698 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:35:46,698 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:35:46,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 7 [2018-10-04 14:35:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:35:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:35:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:46,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:46,755 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:46,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:46,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:46,756 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:46,756 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:46,756 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1585793528, now seen corresponding path program 89 times [2018-10-04 14:35:46,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:46,811 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 14:35:46,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:46,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:46,825 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:46,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:46,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:46,851 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 14:35:46,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:46,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:46,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:46,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:46,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:46,873 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:47,021 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:35:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:47,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:47,022 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:35:47,022 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:35:47,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:47,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:35:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 14:35:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:47,082 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:47,082 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:47,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:47,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:47,083 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:47,083 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:47,083 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1587638648, now seen corresponding path program 90 times [2018-10-04 14:35:47,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:47,210 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 14:35:47,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:47,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:47,218 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:47,226 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:47,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:47,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:47,280 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 14:35:47,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:47,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:47,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:47,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:47,302 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:47,443 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:47,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:47,445 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:47,445 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:47,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 14:35:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:47,511 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:47,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:47,512 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:47,512 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:47,513 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1587640570, now seen corresponding path program 91 times [2018-10-04 14:35:47,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:47,714 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 14:35:47,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:47,715 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:47,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:47,753 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 14:35:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:47,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:47,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:47,775 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:47,902 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:47,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:47,903 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:47,903 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:47,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:35:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2018-10-04 14:35:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:47,945 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:47,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:47,946 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:47,946 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:47,946 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 490842614, now seen corresponding path program 92 times [2018-10-04 14:35:47,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:47,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:47,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:47,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:48,003 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 14:35:48,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:48,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:48,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:48,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:48,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:48,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:48,058 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 14:35:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:48,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:48,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:48,077 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:48,260 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:35:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:48,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:48,261 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:35:48,261 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:35:48,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:35:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:35:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:48,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:48,324 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:48,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:48,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:48,324 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:48,324 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:48,324 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 490844536, now seen corresponding path program 93 times [2018-10-04 14:35:48,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:48,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:48,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:48,382 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 14:35:48,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:48,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:48,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:48,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:48,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:48,441 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 14:35:48,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:48,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:48,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:48,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:48,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:48,462 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:48,649 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:35:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:48,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:48,650 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:35:48,650 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:35:48,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:35:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 14:35:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:48,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:48,739 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:48,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:48,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:48,739 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:48,740 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:48,740 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash 492689656, now seen corresponding path program 94 times [2018-10-04 14:35:48,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:48,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:48,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:49,179 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 14:35:49,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:49,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:49,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:49,193 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:49,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:49,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:49,211 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 14:35:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:49,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:49,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:49,232 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:49,381 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:35:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:49,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:49,382 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:35:49,382 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:35:49,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 14:35:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:35:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:35:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:49,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:49,440 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:49,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:49,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:49,441 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:49,441 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:49,441 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 492691578, now seen corresponding path program 95 times [2018-10-04 14:35:49,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:49,554 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 14:35:49,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:49,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:49,569 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:49,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:49,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:49,611 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 14:35:49,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:49,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:49,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:49,632 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:49,775 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:35:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:49,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:49,776 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:35:49,776 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:35:49,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:35:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 14:35:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:49,826 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:49,827 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:49,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:49,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:49,827 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:49,827 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:49,827 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2029117320, now seen corresponding path program 96 times [2018-10-04 14:35:49,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:49,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:49,998 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 14:35:49,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:49,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:50,007 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:50,014 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:50,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:50,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:50,034 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 14:35:50,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:50,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:50,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:50,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:50,056 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:50,189 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:35:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:50,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:50,190 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:35:50,190 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:35:50,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:35:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:35:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:50,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:50,250 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:50,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:50,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:50,251 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:50,251 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:50,251 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2029115398, now seen corresponding path program 97 times [2018-10-04 14:35:50,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:50,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:50,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:50,350 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 14:35:50,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:50,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:50,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:50,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:50,385 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 14:35:50,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:50,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:50,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:50,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:50,406 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:50,544 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:35:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:50,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:50,545 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:35:50,545 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:35:50,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:35:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 14:35:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:50,605 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:50,605 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:50,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:50,606 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:50,606 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:50,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2027270278, now seen corresponding path program 98 times [2018-10-04 14:35:50,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:50,687 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 14:35:50,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:50,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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:50,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:50,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:50,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:50,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:50,747 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 14:35:50,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:50,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:50,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:50,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:50,767 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:50,905 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:50,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:50,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:50,906 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:50,906 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:50,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 14:35:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:50,971 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:50,971 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:50,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:50,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:50,972 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:50,972 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:50,972 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2027268356, now seen corresponding path program 99 times [2018-10-04 14:35:50,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:50,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,078 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 14:35:51,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:51,079 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:51,095 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:51,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:51,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:51,118 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 14:35:51,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:51,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:51,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:51,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:51,141 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:51,258 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:51,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:51,259 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:51,259 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:51,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 20. [2018-10-04 14:35:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:35:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:35:51,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 14:35:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:51,304 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:35:51,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:35:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:51,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:51,304 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:51,304 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:51,304 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 511848822, now seen corresponding path program 100 times [2018-10-04 14:35:51,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:51,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,359 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 14:35:51,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:51,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:51,371 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:51,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:51,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:51,398 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 14:35:51,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:51,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:51,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:51,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:51,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:51,419 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 14:35:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:51,592 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:51,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:51,593 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:51,593 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:51,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 14:35:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:51,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:51,667 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:51,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:51,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:51,667 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:51,667 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:51,667 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:51,668 INFO L82 PathProgramCache]: Analyzing trace with hash 511850744, now seen corresponding path program 101 times [2018-10-04 14:35:51,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:51,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:51,735 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 14:35:51,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:51,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:51,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:51,753 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:51,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:51,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:51,792 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 14:35:51,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:51,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:51,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:51,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:51,814 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:51,958 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:51,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:51,959 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:51,959 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:51,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 14:35:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:52,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:52,021 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:52,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:52,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:52,021 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:52,021 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:52,022 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash 513695864, now seen corresponding path program 102 times [2018-10-04 14:35:52,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:52,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:52,081 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 14:35:52,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:52,081 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:52,096 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:52,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:52,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:52,137 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 14:35:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:52,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:52,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:52,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:52,158 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:52,309 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:52,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:52,310 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:52,310 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:52,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 14:35:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:52,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:52,382 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:52,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:52,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:52,383 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:52,383 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:52,383 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash 513697786, now seen corresponding path program 103 times [2018-10-04 14:35:52,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:52,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:52,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:52,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:52,451 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 14:35:52,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:52,452 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:52,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:52,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:52,492 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 14:35:52,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:52,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:52,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:52,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:52,515 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:52,653 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:52,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:52,654 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:52,654 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:52,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 14:35:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:52,714 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:52,714 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:52,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:52,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:52,715 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:52,715 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:52,715 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2008111112, now seen corresponding path program 104 times [2018-10-04 14:35:52,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:52,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:52,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:52,785 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:52,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:52,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:52,828 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 14:35:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:52,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:52,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:52,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:52,849 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:52,994 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:52,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:52,995 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:52,995 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:52,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 14:35:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:53,070 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:53,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:53,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:53,071 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:53,071 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:53,071 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2008109190, now seen corresponding path program 105 times [2018-10-04 14:35:53,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:53,134 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 14:35:53,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:53,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:53,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:53,149 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:53,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:53,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:53,190 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 14:35:53,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:53,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:53,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:53,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:53,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:53,211 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:53,361 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:35:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:53,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:53,362 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:35:53,362 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:35:53,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:35:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 14:35:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:53,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:53,431 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:53,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:53,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:53,431 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:53,432 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:53,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2006264070, now seen corresponding path program 106 times [2018-10-04 14:35:53,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:53,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:53,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:53,538 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 14:35:53,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:53,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:53,550 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:53,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:53,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:53,592 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 14:35:53,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:53,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:53,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:53,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:53,613 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:53,754 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:35:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:53,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:53,755 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:35:53,755 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:35:53,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:35:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 14:35:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:53,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:53,826 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:53,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:53,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:53,827 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:53,827 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:53,827 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2006262148, now seen corresponding path program 107 times [2018-10-04 14:35:53,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:53,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:53,890 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 14:35:53,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:53,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:53,906 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:53,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:53,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:54,110 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 14:35:54,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:54,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:54,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:54,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:54,144 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:54,445 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:54,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:54,446 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:54,446 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:54,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 7 [2018-10-04 14:35:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 14:35:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:35:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:35:54,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 14:35:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:54,498 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:35:54,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:35:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:54,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:54,499 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 14:35:54,499 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:54,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1191907192, now seen corresponding path program 108 times [2018-10-04 14:35:54,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:54,557 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 14:35:54,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:54,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:54,565 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:54,573 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:54,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:54,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:54,609 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 14:35:54,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:54,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:54,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:54,629 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 14:35:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:54,758 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:54,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:54,759 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:54,759 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:54,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 14:35:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:54,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:54,828 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:54,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:54,829 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:54,829 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:54,829 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1191909114, now seen corresponding path program 109 times [2018-10-04 14:35:54,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:54,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:55,214 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 14:35:55,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:55,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:55,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:55,294 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 14:35:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:55,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:55,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:55,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:55,316 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:55,435 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:55,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:55,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:55,436 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:55,436 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:55,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 14:35:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 14:35:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:55,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:55,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:55,532 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:55,532 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:55,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1193754234, now seen corresponding path program 110 times [2018-10-04 14:35:55,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:55,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:55,638 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 14:35:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:55,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:35:55,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:35:55,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:55,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:55,699 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 14:35:55,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:55,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:55,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:55,719 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:55,852 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:35:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:55,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:55,853 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:35:55,853 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:35:55,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:35:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 14:35:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:55,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:55,922 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:55,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:55,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:55,923 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:55,923 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:55,923 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1193756156, now seen corresponding path program 111 times [2018-10-04 14:35:55,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:56,023 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 14:35:56,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:56,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:56,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:35:56,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 14:35:56,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:56,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:56,088 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 14:35:56,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:56,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:56,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:56,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:56,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:56,108 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:56,240 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:35:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:56,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:56,241 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:35:56,241 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:35:56,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:35:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 14:35:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:35:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:35:56,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 14:35:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:56,333 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:35:56,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:35:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:56,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:56,333 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 14:35:56,334 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:56,334 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1328052742, now seen corresponding path program 112 times [2018-10-04 14:35:56,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:56,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:56,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:56,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:56,657 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 14:35:56,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:56,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:56,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:35:56,671 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:35:56,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:56,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:56,691 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 14:35:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:56,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:56,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:56,713 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:56,713 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 14:35:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:56,829 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:56,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:56,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:56,830 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:56,830 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:56,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 14:35:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-04 14:35:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:56,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:56,907 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:56,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:56,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:56,907 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:56,907 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:56,908 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1328050820, now seen corresponding path program 113 times [2018-10-04 14:35:56,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:56,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:57,776 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 14:35:57,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:57,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:35:57,888 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:35:57,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:57,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:58,164 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 14:35:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:58,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:58,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:58,186 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:58,318 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:35:58,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:58,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:58,319 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:35:58,319 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:35:58,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 7 [2018-10-04 14:35:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:35:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-10-04 14:35:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:35:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:35:58,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 14:35:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:58,401 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:35:58,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:35:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:58,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:58,402 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 14:35:58,402 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:58,402 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1326205700, now seen corresponding path program 114 times [2018-10-04 14:35:58,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:58,474 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 14:35:58,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:58,474 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:58,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:58,499 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:58,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:58,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:58,529 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 14:35:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:58,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:58,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:58,550 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 14:35:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:58,664 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 14:35:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:58,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:58,665 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:35:58,665 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:35:58,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 14:35:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:35:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-04 14:35:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:35:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:35:58,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 14:35:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:58,743 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:35:58,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:35:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:35:58,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:58,743 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 14:35:58,744 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:58,744 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1326203778, now seen corresponding path program 6 times [2018-10-04 14:35:58,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:58,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:58,822 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 14:35:58,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:58,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:35:58,837 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:35:58,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:35:58,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:58,868 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 14:35:58,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:58,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:35:58,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:35:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:35:58,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:58,896 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 14:35:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:59,007 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-10-04 14:35:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:35:59,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 14:35:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:59,008 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:35:59,008 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:35:59,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:35:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:35:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-10-04 14:35:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:35:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 14:35:59,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 14:35:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:59,073 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 14:35:59,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:35:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 14:35:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:35:59,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:59,073 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 14:35:59,074 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:59,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -168156555, now seen corresponding path program 7 times [2018-10-04 14:35:59,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:35:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:59,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:59,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:59,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:35:59,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:35:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:35:59,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:59,261 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2018-10-04 14:35:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:35:59,591 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:35:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:35:59,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:35:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:35:59,592 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:35:59,592 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:35:59,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:35:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:35:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:35:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:35:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:35:59,678 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:35:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:35:59,679 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:35:59,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:35:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:35:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:35:59,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:35:59,679 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:35:59,679 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:35:59,680 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:35:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -168154633, now seen corresponding path program 115 times [2018-10-04 14:35:59,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:35:59,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:35:59,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:35:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:35:59,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:35:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:35:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:35:59,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:35:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:35:59,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:35:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:35:59,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:35:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:35:59,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:35:59,811 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:00,005 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:00,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:00,006 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:00,006 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:00,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:36:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:00,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:00,102 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:00,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:00,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:00,103 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:00,103 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:00,103 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -166309513, now seen corresponding path program 116 times [2018-10-04 14:36:00,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:00,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:00,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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:00,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:00,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:00,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:00,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:00,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:00,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:00,242 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:00,448 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:00,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:00,449 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:00,449 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:00,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:00,544 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:00,544 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:00,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:00,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:00,545 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:00,545 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:00,545 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -166307591, now seen corresponding path program 117 times [2018-10-04 14:36:00,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:00,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:00,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:00,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:00,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:00,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:00,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:00,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:00,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:00,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:00,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:00,694 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:00,887 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:00,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:00,888 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:00,888 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:00,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:36:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:00,973 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:00,974 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:00,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:00,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:00,974 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:00,974 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:00,974 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1606850807, now seen corresponding path program 118 times [2018-10-04 14:36:00,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:01,091 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:01,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:01,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:01,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:01,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:01,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:01,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:01,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:01,177 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:01,363 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:01,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:01,364 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:01,364 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:01,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:36:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:01,452 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:01,452 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:01,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:01,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:01,453 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:01,453 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:01,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1606852729, now seen corresponding path program 119 times [2018-10-04 14:36:01,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:01,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:01,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:01,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:01,582 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:01,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:01,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:01,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:01,645 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:01,645 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:01,830 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:01,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:01,831 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:01,831 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:01,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:36:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:01,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:01,917 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:01,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:01,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:01,918 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:01,918 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:01,918 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1608697849, now seen corresponding path program 120 times [2018-10-04 14:36:01,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:01,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:01,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:01,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:01,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:01,993 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:01,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:01,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:02,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:02,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:02,050 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:02,230 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:02,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:02,236 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:02,236 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:02,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:02,324 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:02,324 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:02,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:02,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:02,325 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:02,325 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:02,325 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699771, now seen corresponding path program 121 times [2018-10-04 14:36:02,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:02,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:02,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:02,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:02,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:02,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:02,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:02,463 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:02,649 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:02,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:02,650 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:02,650 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:02,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 14:36:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:36:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:36:02,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:36:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:02,727 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:36:02,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:36:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:02,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:02,727 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:02,728 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:02,728 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash 511901815, now seen corresponding path program 122 times [2018-10-04 14:36:02,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:02,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:02,809 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:02,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:02,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:02,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:02,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:02,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:02,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:02,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:02,895 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:36:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,115 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:03,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:03,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,116 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:03,116 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:03,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:03,208 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:03,208 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:03,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:03,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:03,208 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:03,209 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:03,209 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash 511903737, now seen corresponding path program 123 times [2018-10-04 14:36:03,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:03,279 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:03,295 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:03,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:03,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:03,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:03,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:03,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:03,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:03,345 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,545 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:03,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,546 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:03,546 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:03,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:36:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:03,636 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:03,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:03,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:03,637 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:03,637 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:03,637 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 513748857, now seen corresponding path program 124 times [2018-10-04 14:36:03,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:03,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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:03,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:03,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:03,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:03,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:03,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:03,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:03,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:03,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:03,780 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:03,780 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:03,993 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:03,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:03,994 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:03,994 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:03,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:04,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:04,094 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:04,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:04,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:04,094 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:04,094 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:04,094 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash 513750779, now seen corresponding path program 125 times [2018-10-04 14:36:04,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:04,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:04,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:04,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:04,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:04,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:04,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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:04,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:04,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:04,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:04,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:04,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:04,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:04,248 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:04,461 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:04,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:04,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:04,462 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:04,462 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:04,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:36:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:04,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:04,566 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:04,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:04,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:04,567 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:04,567 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:04,567 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2008058119, now seen corresponding path program 126 times [2018-10-04 14:36:04,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:04,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:04,742 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:04,749 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:04,757 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:04,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:04,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:04,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:04,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:04,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:04,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:04,825 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:05,019 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:05,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:05,020 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:05,020 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:05,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 14:36:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:36:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:05,118 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:05,118 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:05,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:05,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:05,118 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:05,119 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:05,119 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2008056197, now seen corresponding path program 127 times [2018-10-04 14:36:05,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:05,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:05,234 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:05,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:05,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:05,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:05,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:05,297 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:05,497 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:05,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:05,498 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:05,498 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:05,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:36:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:05,589 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:05,589 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:05,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:05,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:05,590 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:05,590 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:05,590 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2006211077, now seen corresponding path program 128 times [2018-10-04 14:36:05,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:05,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:05,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:05,690 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:05,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:05,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:05,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:05,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:05,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:05,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:05,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:05,746 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:05,949 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:05,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:05,950 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:05,950 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:05,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:06,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:06,057 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:06,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:06,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:06,058 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:06,058 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:06,058 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2006209155, now seen corresponding path program 129 times [2018-10-04 14:36:06,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:06,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:06,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:06,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:06,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:06,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:06,215 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:06,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:06,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:06,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:06,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:06,289 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:06,474 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:06,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:06,475 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:06,475 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:06,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 14:36:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:36:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:36:06,551 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 14:36:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:06,551 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:36:06,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:36:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:06,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:06,551 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:06,551 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:06,551 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 532908023, now seen corresponding path program 130 times [2018-10-04 14:36:06,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:06,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:06,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:06,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:06,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:06,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:06,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:06,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:06,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:06,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:06,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:06,691 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 14:36:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:06,915 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:06,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:06,916 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:06,916 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:06,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:07,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:07,015 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:07,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:07,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:07,015 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:07,015 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:07,016 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash 532909945, now seen corresponding path program 131 times [2018-10-04 14:36:07,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:07,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:07,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:07,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:07,096 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:07,103 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:07,114 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:07,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:07,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:07,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:07,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:07,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:07,170 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:07,371 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:07,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:07,372 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:07,372 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:07,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:36:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:07,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:07,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:07,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:07,475 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:07,475 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:07,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 534755065, now seen corresponding path program 132 times [2018-10-04 14:36:07,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:07,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:07,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:07,549 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:07,557 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:07,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:07,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:07,612 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:07,612 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:07,810 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:07,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:07,811 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:07,811 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:07,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 14:36:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:07,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:07,919 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:07,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:07,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:07,919 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:07,919 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:07,919 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 534756987, now seen corresponding path program 133 times [2018-10-04 14:36:07,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:07,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:07,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:07,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:08,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:08,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:08,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:08,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:08,057 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:08,235 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:08,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:08,236 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:08,236 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:08,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:36:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:08,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:08,329 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:08,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:08,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:08,330 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:08,330 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:08,330 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1987051911, now seen corresponding path program 134 times [2018-10-04 14:36:08,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:08,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:08,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:08,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:08,414 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:08,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:08,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:08,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:08,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:08,473 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:08,690 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:08,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:08,691 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:08,691 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:08,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:08,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:08,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:08,796 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:08,796 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:08,796 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1987049989, now seen corresponding path program 135 times [2018-10-04 14:36:08,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:08,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:08,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:08,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:08,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:08,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:08,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:08,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:08,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:08,942 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:09,136 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:09,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:09,137 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:09,137 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:09,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:36:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:09,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:09,244 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:09,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:09,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:09,245 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:09,245 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:09,245 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1985204869, now seen corresponding path program 136 times [2018-10-04 14:36:09,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:09,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:09,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:09,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:09,347 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:09,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:09,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:09,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:09,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:09,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:09,411 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:09,601 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:09,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:09,602 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:09,603 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:09,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 14:36:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:09,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:09,719 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:09,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:09,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:09,719 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:09,719 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:09,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1985202947, now seen corresponding path program 137 times [2018-10-04 14:36:09,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:09,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:09,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:09,804 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:09,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:09,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:09,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:09,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:09,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:09,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:09,859 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:10,052 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:10,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:10,053 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:10,053 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:10,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:36:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:36:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:36:10,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:36:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:10,139 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:36:10,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:36:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:10,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:10,139 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:10,139 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:10,139 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1212966393, now seen corresponding path program 138 times [2018-10-04 14:36:10,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:10,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:10,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:10,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:10,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:10,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:10,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:10,221 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:10,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:10,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:10,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:10,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:10,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:10,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:10,292 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:36:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:10,477 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:10,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:10,478 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:10,478 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:10,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 14:36:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:10,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:10,599 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:10,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:10,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:10,600 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:10,600 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:10,600 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1212968315, now seen corresponding path program 139 times [2018-10-04 14:36:10,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:10,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:10,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:10,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:10,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:10,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:10,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:10,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:10,822 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:10,994 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:36:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:10,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:10,995 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:36:10,995 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:36:10,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 8 [2018-10-04 14:36:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:36:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 14:36:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:11,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:11,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:11,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:11,112 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:11,112 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:11,112 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1214813435, now seen corresponding path program 140 times [2018-10-04 14:36:11,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:11,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:11,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:11,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:11,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:11,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:11,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:11,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:11,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:11,283 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:11,478 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:11,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:11,479 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:11,479 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:11,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 14:36:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:11,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:11,591 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:11,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:11,592 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:11,592 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:11,592 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1214815357, now seen corresponding path program 141 times [2018-10-04 14:36:11,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:11,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:11,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:11,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:11,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:11,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:11,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:11,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:11,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:11,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:11,743 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:11,934 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:36:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:11,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:11,935 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:36:11,935 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:36:11,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:36:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:36:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:12,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:12,041 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:12,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:12,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:12,042 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:12,042 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:12,042 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1306993541, now seen corresponding path program 142 times [2018-10-04 14:36:12,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:12,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:12,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:12,118 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:12,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:12,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:12,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:12,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:12,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:12,167 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:12,362 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:36:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:12,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:12,362 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:36:12,363 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:36:12,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:36:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 14:36:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:12,474 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:12,475 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:12,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:12,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:12,475 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:12,475 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:12,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1306991619, now seen corresponding path program 143 times [2018-10-04 14:36:12,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:12,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:12,585 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:12,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:12,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:12,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:12,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:12,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:12,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:12,634 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:12,815 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:36:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:12,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:12,816 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:36:12,816 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:36:12,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:36:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 14:36:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:12,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:12,922 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:12,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:12,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:12,922 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:12,922 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:12,922 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1305146499, now seen corresponding path program 144 times [2018-10-04 14:36:12,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:13,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:13,118 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:13,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:13,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:13,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:13,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:13,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:13,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:13,173 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:13,336 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:36:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:13,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:13,337 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:36:13,337 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:36:13,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 14:36:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:36:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 14:36:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:13,451 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:13,452 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:13,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:13,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:13,452 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:13,452 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:13,452 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1305144577, now seen corresponding path program 145 times [2018-10-04 14:36:13,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:13,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:13,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:13,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:13,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:13,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:13,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:13,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:13,591 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:13,592 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:13,742 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 14:36:13,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:13,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:13,743 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:36:13,743 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:36:13,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:36:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 14:36:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:36:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:36:13,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 14:36:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:13,811 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:36:13,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:36:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:13,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:13,812 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:13,812 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:13,812 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash -754962569, now seen corresponding path program 146 times [2018-10-04 14:36:13,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:13,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:13,884 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:13,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:13,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:13,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:13,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:13,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:13,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:13,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:13,992 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 14:36:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:14,249 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:14,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:14,250 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:14,250 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:14,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:14,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:14,367 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:14,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:14,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:14,367 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:14,367 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:14,367 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -754960647, now seen corresponding path program 147 times [2018-10-04 14:36:14,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:14,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:14,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:14,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:14,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:14,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:14,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:14,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:14,450 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:14,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:14,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:14,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:14,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:14,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:14,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:14,502 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:14,775 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:14,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:14,776 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:14,776 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:14,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:36:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:14,912 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:14,912 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:14,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:14,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:14,912 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:14,912 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:14,912 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash -753115527, now seen corresponding path program 148 times [2018-10-04 14:36:14,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:14,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:14,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:14,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 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:14,985 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:14,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:14,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:15,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:15,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:15,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:15,038 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:15,039 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:15,300 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:15,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:15,301 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:15,301 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:15,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:15,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:15,428 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:15,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:15,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:15,429 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:15,429 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:15,429 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -753113605, now seen corresponding path program 149 times [2018-10-04 14:36:15,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:15,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:15,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:15,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:15,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:15,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 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:15,609 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:15,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:15,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:15,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:15,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:15,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:15,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:15,663 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:15,920 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:15,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:15,921 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:15,921 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:15,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:36:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:16,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:16,027 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:16,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:16,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:16,028 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:16,028 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:16,028 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1020044793, now seen corresponding path program 150 times [2018-10-04 14:36:16,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:16,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:16,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:16,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:16,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:16,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:16,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:16,111 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:16,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:16,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:16,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:16,178 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:16,408 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:16,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:16,409 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:16,409 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:16,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:36:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:16,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:16,535 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:16,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:16,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:16,536 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:16,536 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:16,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1020046715, now seen corresponding path program 151 times [2018-10-04 14:36:16,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:16,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:16,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:16,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:16,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:16,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:16,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:16,731 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:16,981 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:16,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:16,982 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:16,982 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:16,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:36:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:17,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:17,098 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:17,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:17,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:17,098 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:17,098 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:17,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891835, now seen corresponding path program 152 times [2018-10-04 14:36:17,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:17,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:17,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:17,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:17,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:17,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:17,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:17,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:17,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:17,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:17,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:17,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:17,320 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:17,542 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:17,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:17,543 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:17,543 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:17,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:17,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:17,663 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:17,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:17,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:17,663 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:17,663 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:17,663 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1021893757, now seen corresponding path program 153 times [2018-10-04 14:36:17,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:17,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:17,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:17,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:17,745 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:17,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:17,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:17,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:17,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:17,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:17,798 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:18,024 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:18,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:18,025 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:18,025 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:18,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 14:36:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:36:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:36:18,120 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:36:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:18,120 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:36:18,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:36:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:18,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:18,121 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:18,121 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:18,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash -74904199, now seen corresponding path program 154 times [2018-10-04 14:36:18,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:18,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:18,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:18,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:18,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:18,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:18,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:18,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:18,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:18,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:18,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:18,271 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:36:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:18,542 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:18,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:18,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:18,543 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:18,543 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:18,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:18,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:18,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:18,681 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:18,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:18,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:18,682 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:18,682 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:18,682 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:18,682 INFO L82 PathProgramCache]: Analyzing trace with hash -74902277, now seen corresponding path program 155 times [2018-10-04 14:36:18,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:18,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:19,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:19,050 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:19,167 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:19,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:19,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:19,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:19,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:19,469 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:19,728 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:19,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:19,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:19,729 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:19,729 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:19,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 14:36:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 14:36:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:19,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:19,847 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:19,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:19,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:19,848 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:19,848 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:19,848 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash -73057157, now seen corresponding path program 156 times [2018-10-04 14:36:19,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:19,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:19,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:19,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:19,953 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:19,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:20,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:20,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:20,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:20,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:20,014 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:20,282 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:20,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:20,283 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:20,283 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:20,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:20,407 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:20,407 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:20,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:20,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:20,407 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:20,407 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:20,407 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash -73055235, now seen corresponding path program 157 times [2018-10-04 14:36:20,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:20,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:20,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:20,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:20,478 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:20,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:20,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:20,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:20,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:20,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:20,559 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:20,816 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:20,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:20,817 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:20,817 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:20,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:36:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:20,929 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:20,929 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:20,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:20,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:20,930 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:20,930 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:20,930 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1700103163, now seen corresponding path program 158 times [2018-10-04 14:36:20,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:20,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:20,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:21,002 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:21,018 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:21,018 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:21,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:21,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:21,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:21,067 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:21,067 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:21,323 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:21,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:21,324 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:21,324 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:21,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:36:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:21,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:21,454 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:21,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:21,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:21,455 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:21,455 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:21,455 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1700105085, now seen corresponding path program 159 times [2018-10-04 14:36:21,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:21,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:21,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:21,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:21,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:21,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:21,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:21,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:21,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:21,683 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:21,929 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:21,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:21,930 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:21,930 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:21,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:36:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:22,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:22,051 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:22,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:22,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:22,051 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:22,051 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:22,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:22,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1701950205, now seen corresponding path program 160 times [2018-10-04 14:36:22,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:22,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:22,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:22,123 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:22,136 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:22,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:22,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:22,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:22,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:22,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:22,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:22,185 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:22,423 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:22,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:22,424 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:22,424 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:22,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:22,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:22,549 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:22,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:22,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:22,550 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:22,550 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:22,550 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1701952127, now seen corresponding path program 161 times [2018-10-04 14:36:22,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:22,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:22,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:22,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:22,711 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:22,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:22,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:22,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:22,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:22,766 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:23,120 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:23,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:23,121 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:23,121 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:23,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 14:36:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:36:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:36:23,291 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 14:36:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:23,292 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:36:23,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:36:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:23,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:23,292 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:23,293 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:23,293 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -53897991, now seen corresponding path program 162 times [2018-10-04 14:36:23,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:23,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:23,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:23,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:23,659 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:23,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:23,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:23,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:23,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:23,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:23,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:23,702 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 14:36:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:23,963 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:23,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:23,964 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:23,964 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:23,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 8 [2018-10-04 14:36:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:24,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:24,111 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:24,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:24,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:24,111 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:24,111 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:24,111 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -53896069, now seen corresponding path program 163 times [2018-10-04 14:36:24,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:24,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:24,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:24,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:24,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:24,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:24,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:24,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:24,327 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:24,730 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:24,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:24,731 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:24,731 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:24,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:36:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:24,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:24,860 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:24,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:24,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:24,860 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:24,861 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:24,861 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -52050949, now seen corresponding path program 164 times [2018-10-04 14:36:24,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:24,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:24,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:24,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:24,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:24,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:24,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:25,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:25,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:25,007 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:25,247 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:25,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:25,248 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:25,248 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:25,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 14:36:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:25,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:25,388 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:25,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:25,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:25,388 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:25,388 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:25,388 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash -52049027, now seen corresponding path program 165 times [2018-10-04 14:36:25,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:25,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:25,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:25,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:25,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:25,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:25,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:25,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:25,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:25,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:25,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:25,524 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:25,755 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:25,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:25,756 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:25,756 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:25,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 14:36:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:25,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:25,873 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:25,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:25,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:25,874 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:25,874 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:25,874 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1721109371, now seen corresponding path program 166 times [2018-10-04 14:36:25,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:25,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:25,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:25,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:25,958 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:25,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:25,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:26,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:26,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:26,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:26,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:26,024 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:26,271 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:26,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:26,272 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:26,272 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:26,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:36:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:26,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:26,405 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:26,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:26,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:26,405 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:26,405 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:26,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1721111293, now seen corresponding path program 167 times [2018-10-04 14:36:26,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:26,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:26,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:26,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:26,530 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:26,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:26,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:26,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:26,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:26,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:26,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:26,600 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:26,839 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:36:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:26,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:26,840 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:36:26,840 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:36:26,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:36:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:36:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:26,968 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:26,968 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:26,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:26,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:26,969 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:26,969 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:26,969 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1722956413, now seen corresponding path program 168 times [2018-10-04 14:36:26,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:26,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:27,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:27,052 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:27,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:27,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:27,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:27,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:27,121 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:27,352 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:36:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:27,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:27,353 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:36:27,353 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:36:27,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:36:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 14:36:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:27,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:27,498 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:27,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:27,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:27,498 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:27,498 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:27,498 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1722958335, now seen corresponding path program 169 times [2018-10-04 14:36:27,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:27,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:27,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:27,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:27,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:27,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:27,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:27,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:27,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:27,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:27,619 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:27,849 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:27,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:27,850 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:27,850 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:27,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 14:36:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:36:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:36:27,957 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:36:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:27,957 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:36:27,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:36:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:27,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:27,957 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:27,958 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:27,958 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 626160379, now seen corresponding path program 170 times [2018-10-04 14:36:27,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:27,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:28,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:28,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:28,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:28,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:28,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:28,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:28,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:28,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:28,192 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:36:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:28,410 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:28,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:28,411 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:28,411 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:28,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 14:36:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:28,555 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:28,555 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:28,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:28,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:28,556 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:28,556 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:28,556 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash 626162301, now seen corresponding path program 171 times [2018-10-04 14:36:28,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:28,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:28,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:28,641 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:28,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:28,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:28,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:28,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:28,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:28,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:28,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:28,695 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:28,922 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:36:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:28,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:28,922 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:36:28,923 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:36:28,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:36:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 14:36:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:29,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:29,051 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:29,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:29,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:29,051 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:29,051 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:29,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash 628007421, now seen corresponding path program 172 times [2018-10-04 14:36:29,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:29,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:29,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:29,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:29,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:29,122 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:29,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:29,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:29,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:29,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:29,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:29,194 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:29,194 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:29,410 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:36:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:29,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:29,411 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:36:29,411 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:36:29,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:36:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 14:36:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:29,545 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:29,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:29,545 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:29,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:29,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:29,545 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:29,545 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:29,545 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash 628009343, now seen corresponding path program 173 times [2018-10-04 14:36:29,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:29,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:29,628 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:29,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:29,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:29,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:29,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:29,690 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:29,899 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:36:29,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:29,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:29,900 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:36:29,900 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:36:29,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:36:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 14:36:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:30,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:30,024 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:30,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:30,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:30,025 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:30,025 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:30,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1893799555, now seen corresponding path program 174 times [2018-10-04 14:36:30,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:30,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:30,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:30,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:30,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:30,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:30,130 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:30,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:30,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:30,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:30,184 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:30,408 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:36:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:30,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:30,409 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:36:30,409 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:36:30,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:36:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 14:36:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:30,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:30,551 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:30,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:30,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:30,551 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:30,551 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:30,551 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1893797633, now seen corresponding path program 175 times [2018-10-04 14:36:30,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:30,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:30,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:30,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:30,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:30,608 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:30,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:30,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:30,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:30,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:30,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:30,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:30,684 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:30,891 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:36:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:30,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:30,892 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:36:30,892 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:36:30,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:36:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 14:36:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:31,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:31,022 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:31,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:31,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:31,022 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:31,022 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:31,022 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1891952513, now seen corresponding path program 176 times [2018-10-04 14:36:31,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:31,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:31,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:31,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:31,093 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:31,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:31,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:31,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:31,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:31,158 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:31,346 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 14:36:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:31,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:31,347 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:36:31,347 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:36:31,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:36:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 14:36:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:31,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:31,489 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:31,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:31,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:31,489 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:31,489 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:31,489 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1891950591, now seen corresponding path program 177 times [2018-10-04 14:36:31,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:31,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:31,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:31,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:31,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:31,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:31,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:31,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:31,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:31,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:31,630 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:31,821 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 14:36:31,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:31,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:31,827 INFO L225 Difference]: With dead ends: 34 [2018-10-04 14:36:31,827 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:36:31,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:36:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 14:36:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:36:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:36:31,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 14:36:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:31,913 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:36:31,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:36:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:31,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:31,913 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:31,913 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:31,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1448020233, now seen corresponding path program 178 times [2018-10-04 14:36:31,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:31,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:32,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:32,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:32,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:32,508 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:32,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:32,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:32,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:32,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:32,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:32,555 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 14:36:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:32,926 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:32,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:32,927 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:32,927 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:32,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 14:36:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 14:36:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:33,090 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:33,090 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:33,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:33,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:33,090 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:33,091 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:33,091 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1448018311, now seen corresponding path program 179 times [2018-10-04 14:36:33,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:33,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:33,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:33,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:33,180 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:33,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:33,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:33,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:33,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:33,233 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:33,610 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:33,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:33,611 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:33,611 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:33,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 14:36:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:33,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:33,783 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:33,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:33,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:33,783 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:33,784 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:33,784 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1446173191, now seen corresponding path program 180 times [2018-10-04 14:36:33,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:33,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:33,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:33,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:33,842 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:33,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:33,857 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:33,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:33,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:33,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:33,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:33,929 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:34,291 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:36:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:34,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:34,292 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:36:34,292 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:36:34,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:36:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 14:36:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:34,488 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:34,488 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:34,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:34,489 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:34,489 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:34,489 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1446171269, now seen corresponding path program 181 times [2018-10-04 14:36:34,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:34,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:34,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:34,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:34,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:34,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:34,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:34,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:34,625 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:34,985 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:34,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:34,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:34,987 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:34,987 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:34,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 14:36:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:35,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:35,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:35,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:35,136 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:35,136 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:35,136 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash 326987129, now seen corresponding path program 182 times [2018-10-04 14:36:35,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:35,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:35,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:35,208 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:35,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:35,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:35,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:35,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:35,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:35,263 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:35,645 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:35,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:35,646 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:35,646 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:35,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 14:36:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:35,815 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:35,815 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:35,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:35,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:35,816 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:35,816 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:35,816 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 326989051, now seen corresponding path program 183 times [2018-10-04 14:36:35,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:35,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:35,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:35,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:35,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:35,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:35,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:35,971 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:36,372 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:36,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:36,373 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:36,373 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:36,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 14:36:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:36,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:36,532 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:36,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:36,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:36,533 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:36,533 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:36,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 328834171, now seen corresponding path program 184 times [2018-10-04 14:36:36,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:36,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:36,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:36,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:36,616 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:36,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:36,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:36,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:36,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:36,669 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:37,017 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:36:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:37,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:37,018 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:36:37,018 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:36:37,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:36:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 14:36:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:37,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:37,179 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:37,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:37,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:37,179 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:37,179 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:37,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash 328836093, now seen corresponding path program 185 times [2018-10-04 14:36:37,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:37,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:37,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:37,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:37,268 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:37,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:37,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:37,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:37,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:37,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:37,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:37,342 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:37,768 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:37,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:37,769 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:37,769 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:37,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 14:36:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:37,907 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:37,907 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:37,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:37,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:37,908 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:37,908 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:37,908 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -767961863, now seen corresponding path program 186 times [2018-10-04 14:36:37,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:37,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:37,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:37,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:37,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:37,994 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:37,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:37,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:38,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:38,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:38,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:38,048 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:38,409 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:38,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:38,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:38,410 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:38,410 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:38,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:36:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:38,582 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:38,582 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:38,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:38,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:38,582 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:38,583 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:38,583 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash -767959941, now seen corresponding path program 187 times [2018-10-04 14:36:38,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:38,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:38,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:38,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:38,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:38,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:38,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:38,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:38,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:38,718 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:39,064 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:39,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:39,065 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:39,065 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:39,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:36:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:39,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:39,225 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:39,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:39,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:39,226 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:39,226 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:39,226 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash -766114821, now seen corresponding path program 188 times [2018-10-04 14:36:39,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:39,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:39,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:39,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:39,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:39,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:39,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:39,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:39,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:39,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:39,357 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:39,734 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:39,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:39,735 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:39,735 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:39,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:36:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:39,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:39,906 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:39,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:39,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:39,906 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:39,906 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:39,906 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash -766112899, now seen corresponding path program 189 times [2018-10-04 14:36:39,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:39,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:40,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:40,485 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:40,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:40,500 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:40,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:40,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:40,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:40,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:40,564 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:41,046 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:41,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:41,047 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:41,047 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:41,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 14:36:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 14:36:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:41,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:41,200 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:41,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:41,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:41,200 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:41,200 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:41,200 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1007045499, now seen corresponding path program 190 times [2018-10-04 14:36:41,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:41,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:41,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:41,319 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:41,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:41,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:41,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:41,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:41,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:41,370 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:41,712 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:41,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:41,713 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:41,713 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:41,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:36:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:41,898 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:41,898 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:41,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:41,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:41,898 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:41,899 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:41,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1007047421, now seen corresponding path program 191 times [2018-10-04 14:36:41,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:41,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:41,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:42,013 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:42,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:42,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:42,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:42,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:42,082 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:42,406 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:42,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:42,407 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:42,407 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:42,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:42,569 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:42,569 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:42,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:42,570 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:42,570 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:42,570 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1008892541, now seen corresponding path program 192 times [2018-10-04 14:36:42,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:42,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:42,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:42,654 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:42,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:42,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:42,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:42,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:42,706 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:43,020 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:43,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:43,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:43,021 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:43,021 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:43,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:36:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:43,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:43,222 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:43,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:43,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:43,222 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:43,222 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:43,223 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1008894463, now seen corresponding path program 193 times [2018-10-04 14:36:43,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:43,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:43,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:43,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:43,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:43,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:43,345 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:43,647 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:43,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:43,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:43,648 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:43,648 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:43,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 14:36:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:36:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:36:43,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:36:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:43,775 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:36:43,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:36:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:43,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:43,775 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:43,776 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:43,776 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash -746955655, now seen corresponding path program 194 times [2018-10-04 14:36:43,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:43,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:43,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:43,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:43,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:43,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:43,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:43,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:43,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:43,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:43,921 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:36:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:44,347 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:44,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:44,348 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:44,348 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:44,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 14:36:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:44,524 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:44,524 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:44,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:44,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:44,525 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:44,525 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:44,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash -746953733, now seen corresponding path program 195 times [2018-10-04 14:36:44,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:44,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:44,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:44,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:44,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:44,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:44,606 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:44,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:44,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:44,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:44,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:44,671 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:45,073 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:45,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:45,074 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:45,074 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:45,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 14:36:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:45,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:45,250 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:45,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:45,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:45,250 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:45,250 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:45,250 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash -745108613, now seen corresponding path program 196 times [2018-10-04 14:36:45,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:45,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:45,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:45,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:45,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:45,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:45,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:45,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:45,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:45,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:45,398 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:45,398 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:45,823 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:36:45,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:45,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:45,824 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:36:45,824 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:36:45,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:36:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 14:36:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:46,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:46,003 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:46,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:46,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:46,004 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:46,004 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:46,004 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:46,004 INFO L82 PathProgramCache]: Analyzing trace with hash -745106691, now seen corresponding path program 197 times [2018-10-04 14:36:46,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:46,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:46,069 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:46,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:46,085 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:46,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:46,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:46,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:46,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:46,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:46,146 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:46,522 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:46,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:46,523 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:46,523 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:46,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 14:36:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:46,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:46,686 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:46,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:46,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:46,686 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:46,686 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:46,686 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1028051707, now seen corresponding path program 198 times [2018-10-04 14:36:46,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:46,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:46,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:46,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:46,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:46,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:46,769 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:46,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:46,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:46,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:46,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:46,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:46,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:46,821 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:47,239 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:47,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:47,240 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:47,240 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:47,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 14:36:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:47,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:47,421 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:47,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:47,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:47,421 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:47,421 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:47,421 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1028053629, now seen corresponding path program 199 times [2018-10-04 14:36:47,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:47,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:47,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:47,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:47,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:47,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:47,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:47,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:47,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:47,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:47,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:47,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:47,581 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:48,002 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:36:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:48,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:48,003 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:36:48,003 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:36:48,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:36:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 14:36:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:48,182 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:48,182 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:48,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:48,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:48,182 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:48,182 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:48,183 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1029898749, now seen corresponding path program 200 times [2018-10-04 14:36:48,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:48,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:48,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:48,252 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:48,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:48,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:48,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:48,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:48,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:48,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:48,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:48,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:48,333 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:48,737 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:36:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:48,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:48,738 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:36:48,738 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:36:48,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:36:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 14:36:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:48,929 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:48,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:48,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:48,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:48,929 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:48,930 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:48,930 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1029900671, now seen corresponding path program 201 times [2018-10-04 14:36:48,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:49,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 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:49,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:49,020 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:49,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:49,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:49,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:49,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:49,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:49,071 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:49,461 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:49,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:49,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:49,462 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:49,462 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:49,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 14:36:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:36:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:36:49,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:36:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:49,625 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:36:49,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:36:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:49,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:49,625 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:49,625 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:49,625 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash -66897285, now seen corresponding path program 202 times [2018-10-04 14:36:49,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:49,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:49,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:49,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 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:49,711 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:49,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:49,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:49,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:49,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:49,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:49,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:49,769 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:36:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:50,160 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:50,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:50,161 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:50,161 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:50,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:36:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:50,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:50,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:50,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:50,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:50,358 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:50,358 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:50,358 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -66895363, now seen corresponding path program 203 times [2018-10-04 14:36:50,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:50,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:50,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:50,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:50,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:50,439 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:50,448 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:50,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:50,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:50,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:50,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:50,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:50,502 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:50,884 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:50,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:50,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:50,885 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:50,885 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:50,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:36:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:51,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:51,065 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:51,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:51,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:51,066 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:51,066 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:51,066 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash -65050243, now seen corresponding path program 204 times [2018-10-04 14:36:51,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:51,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:51,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:51,180 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:51,187 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:51,196 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:51,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:51,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:51,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:51,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:51,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:51,248 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:51,631 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:36:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:51,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:51,632 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:36:51,632 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:36:51,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:36:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:36:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:51,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:51,817 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:51,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:51,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:51,817 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:51,817 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:51,817 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash -65048321, now seen corresponding path program 205 times [2018-10-04 14:36:51,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:51,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:51,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:51,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:51,885 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:51,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:51,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:51,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:51,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:51,974 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:52,339 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:52,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:52,340 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:52,340 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:52,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 14:36:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:52,506 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:52,506 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:52,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:52,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:52,507 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:52,507 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:52,507 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1708110077, now seen corresponding path program 206 times [2018-10-04 14:36:52,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:52,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:52,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:52,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:52,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:52,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:52,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:52,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:52,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:52,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:52,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:52,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:52,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:52,643 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:52,990 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:52,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:52,991 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:52,991 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:52,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:36:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:53,177 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:53,177 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:53,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:53,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:53,177 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:53,177 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:53,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1708111999, now seen corresponding path program 207 times [2018-10-04 14:36:53,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:53,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:53,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:53,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:53,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:53,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:53,422 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:53,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:53,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:53,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:53,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:53,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:53,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:53,466 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:53,817 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:53,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:53,818 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:53,818 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:53,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 14:36:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:53,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:53,999 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:53,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:53,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:53,999 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:53,999 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:53,999 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1709957119, now seen corresponding path program 208 times [2018-10-04 14:36:54,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:54,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:54,057 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:54,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:54,070 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:54,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:54,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:54,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:54,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:54,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:54,159 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:54,501 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:54,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:54,502 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:54,502 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:54,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:36:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:54,695 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:54,695 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:54,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:54,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:54,696 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:36:54,696 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:54,696 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1709959041, now seen corresponding path program 209 times [2018-10-04 14:36:54,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:54,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:54,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:54,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:54,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:54,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:54,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:54,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:54,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:54,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:54,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:54,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:54,836 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:55,155 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:36:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:55,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:55,156 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:36:55,156 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:36:55,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:36:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-10-04 14:36:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:36:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:36:55,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 14:36:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:55,281 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:36:55,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:36:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:55,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:55,281 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:36:55,281 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:55,282 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2034826247, now seen corresponding path program 210 times [2018-10-04 14:36:55,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:55,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:55,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:55,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:55,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:55,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:55,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:55,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:55,356 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:55,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:55,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:55,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:55,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:55,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:55,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:55,435 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 14:36:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:55,842 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:55,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:55,843 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:55,843 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:55,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:36:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:56,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:56,050 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:56,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:56,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:56,051 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:56,051 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:56,051 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2034824325, now seen corresponding path program 211 times [2018-10-04 14:36:56,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:56,117 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:56,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:56,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:56,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:56,198 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:56,582 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:56,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:56,583 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:56,583 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:56,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:36:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:56,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:56,778 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:56,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:56,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:56,779 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:56,779 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:56,779 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2032979205, now seen corresponding path program 212 times [2018-10-04 14:36:56,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:36:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:56,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 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:36:56,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:36:56,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:56,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:56,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:56,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:56,916 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:36:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:57,308 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:36:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:57,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:57,309 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:36:57,309 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:36:57,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:36:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:36:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:57,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:57,513 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:57,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:57,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:57,513 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:57,514 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:57,514 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2032977283, now seen corresponding path program 213 times [2018-10-04 14:36:57,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:57,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:57,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:57,631 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:36:57,645 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:36:57,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:57,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:57,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:57,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:57,692 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:57,693 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:58,068 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:36:58,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:58,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:58,069 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:36:58,069 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:36:58,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:36:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:36:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 14:36:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:36:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:36:58,257 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:36:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:58,257 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:36:58,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:36:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:58,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:58,257 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:58,258 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:58,258 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash -259818885, now seen corresponding path program 214 times [2018-10-04 14:36:58,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:58,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:58,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:58,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:58,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:58,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:36:58,334 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:36:58,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:58,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:58,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:58,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:58,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:58,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:58,552 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:36:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:58,905 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:58,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:58,906 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:58,906 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:58,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 14:36:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:36:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:36:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:36:59,121 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:36:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:59,121 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:36:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:36:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:59,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:59,121 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:59,121 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:59,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash -259816963, now seen corresponding path program 215 times [2018-10-04 14:36:59,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:59,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:59,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:59,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:36:59,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:36:59,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:59,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:59,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:59,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:59,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:59,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:59,262 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:36:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:36:59,635 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:36:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:36:59,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:36:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:36:59,636 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:36:59,636 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:36:59,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:36:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:36:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 14:36:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:36:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:36:59,838 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:36:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:36:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:36:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:36:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:36:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:36:59,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:36:59,839 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:36:59,839 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:36:59,839 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:36:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -257971843, now seen corresponding path program 216 times [2018-10-04 14:36:59,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:36:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:36:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:59,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:36:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:36:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:36:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:59,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:36:59,896 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:36:59,904 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:36:59,912 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:36:59,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:36:59,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:36:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:36:59,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:36:59,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:36:59,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:36:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:36:59,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:36:59,980 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:00,522 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:00,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:00,523 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:00,523 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:00,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 14:37:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:00,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:00,731 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:00,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:00,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:00,732 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:00,732 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:00,732 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -257969921, now seen corresponding path program 217 times [2018-10-04 14:37:00,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:00,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:00,809 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:00,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:00,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:00,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:00,869 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:01,200 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:37:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:01,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:01,201 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:37:01,201 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:37:01,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:37:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 14:37:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:37:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:37:01,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:37:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:01,371 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:37:01,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:37:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:01,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:01,372 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:01,372 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:01,372 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1354767877, now seen corresponding path program 218 times [2018-10-04 14:37:01,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:01,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:01,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:01,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:01,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:01,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:01,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:01,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:01,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:01,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:01,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:01,517 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:37:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:01,974 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:01,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:01,974 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:01,975 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:01,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:37:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:37:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:02,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:02,202 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:02,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:02,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:02,203 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:02,203 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:02,203 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:02,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1354765955, now seen corresponding path program 219 times [2018-10-04 14:37:02,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:02,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:02,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:02,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:02,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:02,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:02,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:37:02,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:02,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:02,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:02,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:02,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:02,851 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:03,524 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:03,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:03,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:03,525 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:03,525 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:03,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 8 [2018-10-04 14:37:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:37:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 14:37:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:03,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:03,739 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:03,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:03,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:03,739 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:03,739 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:03,740 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1352920835, now seen corresponding path program 220 times [2018-10-04 14:37:03,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:03,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:03,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:03,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:03,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:03,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:03,820 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:03,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:03,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:03,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:03,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:03,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:03,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:03,875 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:04,287 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:04,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:04,288 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:04,288 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:04,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:37:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:04,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:04,500 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:04,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:04,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:04,500 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:04,500 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:04,500 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:04,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1352918913, now seen corresponding path program 221 times [2018-10-04 14:37:04,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:04,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:04,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:04,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:04,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:04,583 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:04,590 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:37:04,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:04,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:04,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:04,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:04,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:04,662 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:05,060 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:05,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:05,061 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:05,061 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:05,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:37:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:37:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 14:37:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:37:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:37:05,258 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:37:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:05,258 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:37:05,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:37:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:05,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:05,258 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:05,258 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:05,258 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 420239485, now seen corresponding path program 222 times [2018-10-04 14:37:05,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:05,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:05,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:05,327 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:05,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:05,343 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:37:05,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:05,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:05,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:05,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:05,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:05,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:05,399 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:37:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:05,779 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:37:05,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:05,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:05,780 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:37:05,780 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:37:05,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:37:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:37:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:05,988 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:05,988 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:05,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:05,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:05,988 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:05,989 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:05,989 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash 420241407, now seen corresponding path program 223 times [2018-10-04 14:37:05,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:05,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:06,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:06,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:06,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:06,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:06,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:06,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:06,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:06,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:06,122 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:06,510 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:37:06,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:06,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:06,511 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:37:06,511 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:37:06,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:37:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 14:37:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:06,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:06,714 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:06,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:06,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:06,714 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:06,714 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:06,714 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 422086527, now seen corresponding path program 224 times [2018-10-04 14:37:06,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:06,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:06,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:06,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:06,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:06,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:06,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:06,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:06,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:06,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:06,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:06,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:06,853 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:07,226 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:07,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:07,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:07,227 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:07,227 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:07,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 14:37:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:07,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:07,443 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:07,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:07,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:07,444 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:37:07,444 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:07,444 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash 422088449, now seen corresponding path program 225 times [2018-10-04 14:37:07,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:07,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:07,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:07,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:07,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:07,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:07,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:37:07,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:07,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:07,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:07,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:07,794 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:08,131 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:37:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:08,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:08,132 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:37:08,132 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:37:08,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 14:37:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:37:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 24. [2018-10-04 14:37:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:37:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:37:08,285 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 14:37:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:08,285 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:37:08,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:37:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:08,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:08,285 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:08,285 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:08,285 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1333761669, now seen corresponding path program 226 times [2018-10-04 14:37:08,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:08,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:08,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:08,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:08,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:08,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:08,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:08,739 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:08,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:08,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:08,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:08,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:08,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:08,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:08,789 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 14:37:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:09,144 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:09,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:09,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:09,145 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:09,145 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:09,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-04 14:37:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 14:37:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:09,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:09,365 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:09,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:09,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:09,366 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:09,366 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:09,366 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1333759747, now seen corresponding path program 227 times [2018-10-04 14:37:09,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:09,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:09,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:09,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:09,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:09,429 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:09,438 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:09,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:37:09,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:09,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:09,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:09,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:09,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:09,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:09,510 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:09,875 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:09,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:09,875 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:09,876 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:09,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:37:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:10,086 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:10,086 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:10,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:10,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:10,087 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:10,087 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:10,087 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1331914627, now seen corresponding path program 228 times [2018-10-04 14:37:10,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:10,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:10,140 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:10,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:10,156 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:37:10,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:10,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:10,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:10,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:10,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:10,209 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:10,558 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:37:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:10,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:10,559 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:37:10,559 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:37:10,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:37:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 14:37:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:10,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:10,787 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:10,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:10,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:10,787 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:10,788 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:10,788 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1331912705, now seen corresponding path program 229 times [2018-10-04 14:37:10,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:10,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:10,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:10,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:10,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:10,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:10,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:10,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:10,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:10,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:10,925 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:11,303 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:37:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:11,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:11,304 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:37:11,304 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:37:11,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:37:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 14:37:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:37:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:37:11,509 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:37:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:11,509 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:37:11,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:37:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:11,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:11,510 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:11,510 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:11,510 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 441245693, now seen corresponding path program 230 times [2018-10-04 14:37:11,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:11,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:11,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:11,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:11,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:11,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:11,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:11,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:11,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:11,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:11,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:11,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:11,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:11,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:11,636 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:37:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:11,990 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:11,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:11,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:11,991 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:11,991 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:11,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 14:37:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:12,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:12,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:12,208 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:12,208 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:12,208 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 441247615, now seen corresponding path program 231 times [2018-10-04 14:37:12,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:12,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:12,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:12,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:12,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:37:12,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:12,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:12,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:12,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:12,476 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:12,844 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:37:12,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:12,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:12,845 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:37:12,845 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:37:12,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 14:37:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:37:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 14:37:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:13,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:13,056 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:13,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:13,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:13,056 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:13,056 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:13,056 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash 443092735, now seen corresponding path program 232 times [2018-10-04 14:37:13,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:13,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:13,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:13,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:13,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:13,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:13,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:13,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:13,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:13,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:13,202 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:13,547 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:37:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:13,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:13,548 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:37:13,548 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:37:13,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:37:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:37:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 14:37:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:13,772 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:13,772 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:13,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:13,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:13,773 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:37:13,773 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:13,773 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 443094657, now seen corresponding path program 233 times [2018-10-04 14:37:13,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:13,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:13,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:13,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:13,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:13,839 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:13,858 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:37:13,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:13,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:13,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:13,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:13,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:13,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:13,920 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:14,253 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:37:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:14,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:14,254 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:37:14,254 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:37:14,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:37:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 14:37:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:37:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:37:14,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 14:37:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:14,434 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:37:14,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:37:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:14,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:14,434 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 14:37:14,434 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:14,434 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -653703299, now seen corresponding path program 234 times [2018-10-04 14:37:14,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:14,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:14,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:14,490 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:14,499 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:14,506 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:37:14,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:14,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:14,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:14,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:14,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:14,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:14,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:14,559 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 14:37:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:14,891 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:37:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:14,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:14,892 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:37:14,892 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:37:14,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:37:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 14:37:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:15,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:15,124 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:15,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:15,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:15,124 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:15,124 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:15,124 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -653701377, now seen corresponding path program 235 times [2018-10-04 14:37:15,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:15,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:15,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:15,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:15,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:15,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:15,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:15,241 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:15,566 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:37:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:15,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:15,567 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:37:15,567 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:37:15,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:37:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 14:37:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:15,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:15,783 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:15,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:15,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:15,783 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:15,783 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:15,783 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -651856257, now seen corresponding path program 236 times [2018-10-04 14:37:15,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:15,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:15,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:15,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:15,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:15,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:15,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:15,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:15,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:15,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:15,981 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:15,981 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:16,321 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:37:16,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:16,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:16,322 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:37:16,322 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:37:16,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:37:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:37:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 14:37:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:16,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:16,548 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:16,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:16,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:16,548 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:37:16,549 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:16,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash -651854335, now seen corresponding path program 237 times [2018-10-04 14:37:16,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:16,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:16,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:16,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:16,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 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:16,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:16,631 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 14:37:16,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:16,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:16,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:16,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:16,683 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:17,015 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:37:17,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:17,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:17,016 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:37:17,016 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:37:17,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:37:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 14:37:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:37:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:37:17,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 14:37:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:17,233 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:37:17,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:37:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:17,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:17,234 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:37:17,234 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:17,234 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1121304063, now seen corresponding path program 238 times [2018-10-04 14:37:17,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:17,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:17,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:17,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:17,295 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:17,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:17,308 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:17,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:17,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:17,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:17,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:17,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:17,370 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 14:37:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:17,674 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:37:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:17,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:17,675 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:37:17,675 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:37:17,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:37:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-10-04 14:37:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:17,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:17,902 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:17,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:17,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:17,902 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:37:17,902 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:17,902 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1121305985, now seen corresponding path program 239 times [2018-10-04 14:37:17,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:17,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:17,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:18,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:18,027 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 14:37:18,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:18,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:18,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:18,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:18,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:18,096 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:18,416 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:37:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:18,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:18,417 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:37:18,417 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:37:18,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:37:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:37:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-04 14:37:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:18,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 14:37:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:18,651 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:18,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:18,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:18,651 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 14:37:18,651 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:18,652 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1123151105, now seen corresponding path program 240 times [2018-10-04 14:37:18,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:18,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:18,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:18,729 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 14:37:18,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:18,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:18,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:18,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:18,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:18,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:18,780 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:18,780 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 14:37:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:19,071 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 14:37:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:19,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:19,072 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:37:19,072 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:37:19,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:37:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 14:37:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:19,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 14:37:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:19,307 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:19,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:37:19,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:19,308 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 14:37:19,308 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:19,308 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1123153027, now seen corresponding path program 7 times [2018-10-04 14:37:19,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:19,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:19,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:19,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:19,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:19,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:19,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:37:19,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:37:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:37:19,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:19,448 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 14:37:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:19,723 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2018-10-04 14:37:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:37:19,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 14:37:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:19,724 INFO L225 Difference]: With dead ends: 36 [2018-10-04 14:37:19,724 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:37:19,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 14:37:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:37:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-10-04 14:37:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:37:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 14:37:19,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 14:37:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:19,863 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 14:37:19,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:37:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 14:37:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:19,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:19,863 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2018-10-04 14:37:19,864 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:19,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1610002744, now seen corresponding path program 8 times [2018-10-04 14:37:19,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:19,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:19,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:19,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:19,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:19,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:19,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:20,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:20,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:20,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:20,034 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2018-10-04 14:37:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:20,603 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:20,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:20,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:20,605 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:20,605 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:20,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:37:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:20,877 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:20,877 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:20,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:20,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:20,878 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:20,878 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:20,878 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1610004666, now seen corresponding path program 241 times [2018-10-04 14:37:20,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:20,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:20,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:20,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:20,965 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:20,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:20,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:21,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:21,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:21,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:21,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:21,050 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:21,618 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:21,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:21,619 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:21,619 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:21,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:37:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:21,894 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:21,894 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:21,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:21,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:21,894 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:21,894 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:21,895 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1611849786, now seen corresponding path program 242 times [2018-10-04 14:37:21,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:21,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:21,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:22,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:22,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:22,612 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:22,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:22,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:22,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:22,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:22,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:22,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:22,657 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:23,206 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:37:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:23,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:23,207 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:37:23,207 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:37:23,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 9 [2018-10-04 14:37:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:37:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:37:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:23,481 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:23,481 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:23,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:23,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:23,482 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:23,482 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:23,482 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851708, now seen corresponding path program 243 times [2018-10-04 14:37:23,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:23,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:23,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:23,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:23,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:23,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:23,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:23,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:23,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:23,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:23,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:23,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:23,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:23,620 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:24,150 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:24,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:24,151 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:24,151 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:24,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:37:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 14:37:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:24,401 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:37:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:24,401 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:24,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:24,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:24,401 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:24,402 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:24,402 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash -909957190, now seen corresponding path program 244 times [2018-10-04 14:37:24,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:24,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:24,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:24,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:24,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:24,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:24,490 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:24,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:24,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:24,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:24,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:24,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:24,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:24,559 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:37:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:25,134 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:25,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:25,135 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:25,135 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:25,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:37:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:25,406 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:25,406 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:25,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:25,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:25,406 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:25,406 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:25,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -909955268, now seen corresponding path program 245 times [2018-10-04 14:37:25,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:25,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:25,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:25,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:25,474 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:25,482 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:25,492 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:25,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:25,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:25,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:25,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:25,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:25,542 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:26,125 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:26,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:26,126 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:26,126 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:26,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:37:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:37:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:26,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:26,392 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:26,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:26,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:26,392 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:26,392 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:26,392 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash -908110148, now seen corresponding path program 246 times [2018-10-04 14:37:26,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:26,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:26,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:26,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:26,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:26,491 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:26,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:26,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:26,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:26,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:26,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:26,559 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:27,124 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:37:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:27,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:27,125 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:37:27,125 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:37:27,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:37:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:37:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:27,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:27,408 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:27,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:27,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:27,408 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:27,408 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:27,409 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -908108226, now seen corresponding path program 247 times [2018-10-04 14:37:27,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:27,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:27,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:27,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:27,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:27,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:27,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:27,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:27,575 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:28,121 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:28,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:28,122 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:28,122 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:28,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 14:37:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:37:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:37:28,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:37:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:28,358 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:37:28,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:37:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:28,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:28,359 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:28,359 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:28,359 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2004906182, now seen corresponding path program 248 times [2018-10-04 14:37:28,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:28,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:28,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:28,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:28,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:28,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:28,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:28,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:28,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:28,506 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:37:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:29,052 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:29,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:29,053 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:29,053 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:29,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:37:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:29,327 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:29,327 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:29,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:29,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:29,327 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:29,328 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:29,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2004904260, now seen corresponding path program 249 times [2018-10-04 14:37:29,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:29,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:29,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:29,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:29,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:29,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:29,427 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:29,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:29,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:29,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:29,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:29,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:29,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:29,534 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:30,050 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:30,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:30,051 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:30,051 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:30,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:37:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:30,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:30,322 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:30,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:30,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:30,322 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:30,323 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:30,323 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2003059140, now seen corresponding path program 250 times [2018-10-04 14:37:30,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:30,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:30,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:30,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:30,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:30,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:30,409 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:30,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:30,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:30,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:30,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:30,481 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:31,042 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:31,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:31,043 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:31,043 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:31,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:37:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:31,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:31,319 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:31,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:31,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:31,320 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:31,320 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:31,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2003057218, now seen corresponding path program 251 times [2018-10-04 14:37:31,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:31,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:31,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:31,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:31,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:31,440 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:31,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:31,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:31,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:31,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:31,500 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:32,025 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:32,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:32,026 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:32,026 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:32,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 14:37:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:32,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:37:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:32,277 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:32,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:32,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:32,278 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:32,278 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:32,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash -229898820, now seen corresponding path program 252 times [2018-10-04 14:37:32,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:32,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:32,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:32,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:32,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:32,347 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:32,357 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:32,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:32,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:32,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:32,428 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:37:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:32,903 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:32,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:32,904 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:32,904 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:32,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 14:37:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:33,183 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:33,184 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:33,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:33,184 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:33,184 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:33,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -229896898, now seen corresponding path program 253 times [2018-10-04 14:37:33,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:33,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:33,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:33,315 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:33,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:33,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:33,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:33,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:33,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:33,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:33,424 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:33,924 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:33,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:33,925 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:33,925 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:33,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:37:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:37:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:34,201 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:34,201 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:34,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:34,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:34,201 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:34,201 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:34,201 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -228051778, now seen corresponding path program 254 times [2018-10-04 14:37:34,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:34,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:34,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:34,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:34,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:34,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:34,289 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:34,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:34,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:34,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:34,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:34,354 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:34,829 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:34,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:34,830 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:34,830 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:34,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:37:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:37:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:35,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:35,107 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:35,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:35,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:35,107 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:37:35,107 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:35,107 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:35,108 INFO L82 PathProgramCache]: Analyzing trace with hash -228049856, now seen corresponding path program 255 times [2018-10-04 14:37:35,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:35,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:35,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:35,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:35,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:35,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:35,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:35,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:35,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:35,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:35,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:35,266 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:35,722 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:37:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:35,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:35,723 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:37:35,723 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:37:35,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:37:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:37:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:37:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:37:36,018 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 14:37:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:36,018 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:37:36,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:37:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:36,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:36,019 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:36,019 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:36,019 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1983899974, now seen corresponding path program 256 times [2018-10-04 14:37:36,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:36,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:36,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:36,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:36,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:36,148 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:36,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:36,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:36,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:36,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:36,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:36,194 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:36,194 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 14:37:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:36,797 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:36,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:36,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:36,798 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:36,798 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:36,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:37:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:37,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:37,082 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:37,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:37,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:37,082 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:37,082 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:37,082 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1983898052, now seen corresponding path program 257 times [2018-10-04 14:37:37,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:37,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:37,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:37,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:37,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:37,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:37,161 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:37,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:37,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:37,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:37,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:37,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:37,214 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:37,214 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:37,806 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:37,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:37,807 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:37,807 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:37,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:37:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:37:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:38,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:38,083 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:38,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:38,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:38,083 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:38,083 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:38,083 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1982052932, now seen corresponding path program 258 times [2018-10-04 14:37:38,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:38,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:38,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:38,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:38,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:38,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:38,586 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:38,604 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:38,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:38,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:38,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:38,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:38,651 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:39,262 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:37:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:39,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:39,263 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:37:39,263 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:37:39,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 9 [2018-10-04 14:37:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:37:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:37:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:39,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:39,562 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:39,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:39,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:39,562 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:39,562 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:39,562 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:39,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1982051010, now seen corresponding path program 259 times [2018-10-04 14:37:39,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:39,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:39,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:39,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:39,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:39,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:39,638 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:39,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:39,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:39,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:39,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:39,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:39,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:39,718 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:40,298 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:40,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:40,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:40,299 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:40,299 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:40,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 14:37:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:40,579 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:37:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:40,579 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:40,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:40,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:40,580 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:40,580 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:40,580 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash -208892612, now seen corresponding path program 260 times [2018-10-04 14:37:40,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:40,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:40,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:40,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:40,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:40,660 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:40,673 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:40,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:40,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:40,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:40,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:40,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:40,725 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:40,725 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:37:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:41,370 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:41,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:41,371 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:41,371 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:41,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:37:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:41,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:41,663 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:41,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:41,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:41,663 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:41,664 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:41,664 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash -208890690, now seen corresponding path program 261 times [2018-10-04 14:37:41,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:41,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:41,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:41,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:41,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:41,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:41,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:41,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:41,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:41,838 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:42,473 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:37:42,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:42,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:42,474 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:37:42,474 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:37:42,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:37:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:37:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:42,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:42,757 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:42,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:42,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:42,757 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:42,757 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:42,757 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -207045570, now seen corresponding path program 262 times [2018-10-04 14:37:42,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:42,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:42,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:42,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:42,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:42,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:42,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:42,838 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:42,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:42,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:42,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:42,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:42,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:42,896 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:43,509 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:37:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:43,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:43,510 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:37:43,510 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:37:43,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:37:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:37:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:37:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:43,802 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:43,802 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:43,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:43,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:43,802 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:37:43,803 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:43,803 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -207043648, now seen corresponding path program 263 times [2018-10-04 14:37:43,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:43,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:43,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:43,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:43,909 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:43,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:43,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:43,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:43,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:43,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:43,977 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:44,572 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:44,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:44,573 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:44,573 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:44,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 14:37:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:37:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:37:44,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:37:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:44,838 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:37:44,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:37:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:44,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:44,839 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:44,839 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:44,839 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1303841604, now seen corresponding path program 264 times [2018-10-04 14:37:44,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:44,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:44,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:44,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:44,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:44,944 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:44,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:44,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:44,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:44,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:44,995 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:37:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:45,595 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:45,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:45,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:45,596 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:45,596 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:45,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:37:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:45,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:45,908 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:45,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:45,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:45,909 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:45,909 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:45,909 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1303839682, now seen corresponding path program 265 times [2018-10-04 14:37:45,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:45,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:46,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:46,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:46,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:46,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:46,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:46,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:46,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:46,314 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:46,861 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:46,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:46,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:46,862 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:46,862 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:46,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 9 [2018-10-04 14:37:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:37:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:47,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:47,150 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:47,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:47,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:47,150 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:47,151 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:47,151 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1301994562, now seen corresponding path program 266 times [2018-10-04 14:37:47,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:47,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:47,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:47,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:47,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:47,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:47,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:47,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:47,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:47,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:47,312 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:47,902 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:37:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:47,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:47,903 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:37:47,903 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:37:47,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:37:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:37:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:48,219 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:48,219 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:48,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:48,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:48,220 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:37:48,220 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:48,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1301992640, now seen corresponding path program 267 times [2018-10-04 14:37:48,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:48,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:48,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:48,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:48,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:48,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:48,285 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:48,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:48,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:48,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:48,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:48,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:48,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:48,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:48,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:48,586 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:49,151 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:49,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:49,152 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:49,152 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:49,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 14:37:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 14:37:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:49,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:37:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:49,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:49,448 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:49,448 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:49,448 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 471165758, now seen corresponding path program 268 times [2018-10-04 14:37:49,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:49,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:49,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:49,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:49,543 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:49,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:49,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:49,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:49,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:49,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:49,614 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:37:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:50,156 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:50,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:50,157 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:50,157 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:50,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 14:37:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:50,467 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:50,467 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:50,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:50,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:50,468 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:37:50,468 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:50,468 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash 471167680, now seen corresponding path program 269 times [2018-10-04 14:37:50,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:50,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:50,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:50,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:50,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:50,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:50,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:50,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:50,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:50,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:50,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:50,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:50,641 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:51,182 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:51,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:51,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:51,183 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:51,183 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:51,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:37:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:51,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:51,482 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:51,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:51,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:51,482 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:37:51,482 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:51,482 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash 473012800, now seen corresponding path program 270 times [2018-10-04 14:37:51,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:51,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:51,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:51,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:51,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:51,574 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:51,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:51,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:51,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:51,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:51,643 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:52,168 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:52,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:52,169 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:52,169 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:52,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:37:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:37:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:52,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:52,465 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:52,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:52,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:52,466 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:52,466 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:52,466 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:52,466 INFO L82 PathProgramCache]: Analyzing trace with hash 473014722, now seen corresponding path program 271 times [2018-10-04 14:37:52,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:52,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:52,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:52,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:52,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:52,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:52,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:52,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:52,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:52,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:52,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:52,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:52,618 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:53,118 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:37:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:53,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:53,119 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:37:53,119 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:37:53,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:37:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 14:37:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:37:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:37:53,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 14:37:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:53,320 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:37:53,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:37:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:53,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:53,321 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:37:53,321 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:53,321 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1023196730, now seen corresponding path program 272 times [2018-10-04 14:37:53,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:53,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:53,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:37:53,405 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:37:53,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:53,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:53,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:53,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:53,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:53,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:53,461 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 14:37:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:54,027 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:54,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:54,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:54,028 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:54,028 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:54,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:37:54,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:37:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:54,341 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:54,342 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:54,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:54,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:54,342 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:54,342 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:54,342 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1023198652, now seen corresponding path program 273 times [2018-10-04 14:37:54,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:54,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:54,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:54,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:37:54,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:37:54,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:54,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:54,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:54,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:54,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:54,502 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:55,079 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:55,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:55,080 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:55,080 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:55,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:37:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:37:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:37:55,390 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:37:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:55,390 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:37:55,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:37:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:55,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:55,391 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:55,391 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:55,391 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1025043772, now seen corresponding path program 274 times [2018-10-04 14:37:55,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:55,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:55,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:55,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:55,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:55,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 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:55,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:37:55,875 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:37:55,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:55,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:56,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:56,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:56,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:56,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:56,071 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:37:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:56,659 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:37:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:56,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:56,660 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:37:56,660 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:37:56,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 9 [2018-10-04 14:37:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:37:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:37:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:57,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:57,004 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:57,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:57,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:57,004 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:57,004 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:57,005 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1025045694, now seen corresponding path program 275 times [2018-10-04 14:37:57,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:57,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:57,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:57,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:37:57,158 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:37:57,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:57,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:57,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:57,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:57,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:57,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:57,211 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:57,788 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:37:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:57,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:57,789 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:37:57,789 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:37:57,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 14:37:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:37:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:37:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:37:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:37:58,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:37:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:58,080 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:37:58,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:37:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:58,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:58,080 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:37:58,080 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:58,080 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1496763204, now seen corresponding path program 276 times [2018-10-04 14:37:58,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:58,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:58,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:37:58,178 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:37:58,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:37:58,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:58,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:58,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:58,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:58,247 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:37:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:58,785 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:58,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:58,786 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:58,786 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:58,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:37:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:37:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:37:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:37:59,123 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:37:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:37:59,123 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:37:59,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:37:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:37:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:37:59,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:37:59,123 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:37:59,124 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:37:59,124 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:37:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1496761282, now seen corresponding path program 277 times [2018-10-04 14:37:59,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:37:59,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:37:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:59,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:37:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:37:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:37:59,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:37:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:37:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:37:59,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:37:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:37:59,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:37:59,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:37:59,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:37:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:37:59,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:37:59,288 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:37:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:37:59,834 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:37:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:37:59,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:37:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:37:59,835 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:37:59,835 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:37:59,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:37:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:38:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:38:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:00,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:00,268 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:00,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:00,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:00,269 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:00,269 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:00,269 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1494916162, now seen corresponding path program 278 times [2018-10-04 14:38:00,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:00,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:00,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:00,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:00,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:00,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:00,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:00,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:00,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:00,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:00,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:00,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:00,415 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:00,950 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:00,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:00,951 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:00,951 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:00,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:38:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:01,277 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:01,278 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:01,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:01,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:01,278 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:01,278 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:01,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1494914240, now seen corresponding path program 279 times [2018-10-04 14:38:01,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:01,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:01,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:01,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:01,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:01,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:01,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:01,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:01,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:01,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:01,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:01,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:01,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:01,433 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:01,926 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:38:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:01,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:01,927 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:38:01,927 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:38:01,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:38:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:38:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:38:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:38:02,195 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:38:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:02,196 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:38:02,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:38:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:02,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:02,196 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:02,196 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:02,196 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1703255100, now seen corresponding path program 280 times [2018-10-04 14:38:02,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:02,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:02,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:02,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:02,287 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:02,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:02,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:02,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:02,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:02,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:02,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:02,344 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:38:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:02,967 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:38:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:02,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:02,968 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:38:02,968 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:38:02,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:38:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:38:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:03,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:03,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:03,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:03,292 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:03,293 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:03,293 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1703257022, now seen corresponding path program 281 times [2018-10-04 14:38:03,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:03,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:03,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:03,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:03,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:03,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:03,391 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:03,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:03,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:03,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:03,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:03,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:03,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:03,448 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:04,027 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:38:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:04,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:04,028 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:38:04,028 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:38:04,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:38:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:38:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:04,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:04,360 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:04,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:04,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:04,360 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:04,360 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:04,360 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1705102142, now seen corresponding path program 282 times [2018-10-04 14:38:04,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:04,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:04,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:04,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:04,434 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:04,442 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:04,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:04,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:04,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:04,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:04,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:04,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:04,700 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:05,926 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:38:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:05,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:05,927 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:38:05,927 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:38:05,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:38:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:38:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:38:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:06,245 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:06,245 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:06,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:06,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:06,246 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:06,246 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:06,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1705104064, now seen corresponding path program 283 times [2018-10-04 14:38:06,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:06,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:06,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:06,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:06,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:06,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:06,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:06,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:06,392 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:06,956 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:38:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:06,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:06,957 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:38:06,957 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:38:06,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:38:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:38:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:07,384 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:07,384 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:07,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:07,384 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:07,385 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:07,385 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash -816704834, now seen corresponding path program 284 times [2018-10-04 14:38:07,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:07,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:07,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:07,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:07,483 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:07,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:07,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:07,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:07,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:07,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:07,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:07,547 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:08,090 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:38:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:08,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:08,091 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:38:08,091 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:38:08,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:38:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:38:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:08,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:08,440 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:08,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:08,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:08,441 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:08,441 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:08,441 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:08,441 INFO L82 PathProgramCache]: Analyzing trace with hash -816702912, now seen corresponding path program 285 times [2018-10-04 14:38:08,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:08,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:08,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:08,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:08,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:08,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:08,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:08,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:08,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:08,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:08,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:08,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:08,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:08,588 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:09,151 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:38:09,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:09,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:09,152 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:38:09,152 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:38:09,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:38:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:38:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:09,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:09,482 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:09,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:09,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:09,482 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:09,483 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:09,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -814857792, now seen corresponding path program 286 times [2018-10-04 14:38:09,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:09,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:09,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:09,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:09,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:09,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:09,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:09,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:09,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:09,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:09,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:09,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:09,629 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:10,156 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:10,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:10,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:10,157 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:10,157 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:10,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:38:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:10,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:10,488 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:10,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:10,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:10,488 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:10,488 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:10,489 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -814855870, now seen corresponding path program 287 times [2018-10-04 14:38:10,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:10,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:10,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:10,586 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:10,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:10,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:10,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:10,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:10,638 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:10,638 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:11,132 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:38:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:11,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:11,133 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:38:11,133 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:38:11,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:38:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 14:38:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:38:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:38:11,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 14:38:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:11,383 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:38:11,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:38:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:11,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:11,383 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:11,383 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:11,384 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1724261308, now seen corresponding path program 288 times [2018-10-04 14:38:11,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:11,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:11,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:11,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:11,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:11,469 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:11,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:11,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:11,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:11,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:11,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:11,538 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:11,538 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 14:38:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:12,057 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:12,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:12,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:12,060 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:12,060 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:12,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:38:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:12,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:12,394 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:12,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:12,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:12,394 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:12,394 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:12,394 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1724263230, now seen corresponding path program 289 times [2018-10-04 14:38:12,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:12,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:12,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:12,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:12,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:12,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:12,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:12,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:12,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:12,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:12,551 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:13,081 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:13,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:13,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:13,082 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:13,082 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:13,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:38:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:13,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:13,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:13,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:13,409 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:13,409 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:13,409 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1726108350, now seen corresponding path program 290 times [2018-10-04 14:38:13,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:13,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:13,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:13,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:13,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:13,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:13,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:13,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:13,558 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:14,043 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:38:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:14,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:14,043 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:38:14,044 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:38:14,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:38:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 14:38:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:14,374 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:14,374 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:14,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:14,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:14,374 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:14,374 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:14,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:14,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1726110272, now seen corresponding path program 291 times [2018-10-04 14:38:14,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:14,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:14,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:14,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:14,469 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:14,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:14,484 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:14,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:14,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:14,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:14,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:14,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:14,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:14,536 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:15,019 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:38:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:15,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:15,020 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:38:15,020 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:38:15,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:38:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:38:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:15,348 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:15,348 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:15,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:15,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:15,349 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:15,349 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:15,349 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -795698626, now seen corresponding path program 292 times [2018-10-04 14:38:15,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:15,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:15,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:15,429 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:15,444 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:15,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:15,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:15,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:15,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:15,507 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:16,035 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:16,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:16,036 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:16,036 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:16,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:38:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:16,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:16,393 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:16,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:16,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:16,394 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:16,394 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:16,394 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -795696704, now seen corresponding path program 293 times [2018-10-04 14:38:16,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:16,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:16,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:16,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:16,477 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:16,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:16,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:16,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:16,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:16,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:16,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:16,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:16,533 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:17,048 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:17,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:17,049 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:17,049 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:17,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:38:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:17,373 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:17,374 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:17,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:17,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:17,374 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:17,374 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:17,374 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash -793851584, now seen corresponding path program 294 times [2018-10-04 14:38:17,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:17,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:17,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:17,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:17,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:17,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:17,462 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:17,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:17,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:17,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:17,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:17,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:17,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:17,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:17,563 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:18,061 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:38:18,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:18,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:18,062 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:38:18,062 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:38:18,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:38:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 14:38:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:18,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:18,391 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:18,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:18,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:18,392 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:18,392 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:18,392 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash -793849662, now seen corresponding path program 295 times [2018-10-04 14:38:18,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:18,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:18,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:18,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:18,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:18,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:18,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:18,562 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:18,562 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:19,051 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:38:19,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:19,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:19,052 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:38:19,052 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:38:19,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:38:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 14:38:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:38:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:38:19,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:38:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:19,345 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:38:19,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:38:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:19,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:19,346 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:19,346 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:19,346 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1890647618, now seen corresponding path program 296 times [2018-10-04 14:38:19,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:19,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:19,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:19,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:19,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:19,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:19,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:19,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:19,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:19,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:19,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:19,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:19,570 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:38:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:20,050 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:38:20,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:20,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:20,051 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:38:20,051 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:38:20,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 14:38:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:38:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 14:38:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:20,377 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:20,377 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:20,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:20,378 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:20,378 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:20,378 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1890645696, now seen corresponding path program 297 times [2018-10-04 14:38:20,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:20,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:20,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:20,551 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:20,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:20,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:20,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:20,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:20,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:20,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:20,628 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:21,085 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:38:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:21,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:21,086 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:38:21,086 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:38:21,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:38:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:38:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 14:38:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:21,414 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:21,414 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:21,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:21,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:21,414 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:21,415 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:21,415 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:21,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1888800576, now seen corresponding path program 298 times [2018-10-04 14:38:21,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:21,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:21,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:21,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:21,508 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:21,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:21,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:21,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:21,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:21,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:21,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:21,584 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:22,094 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:38:22,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:22,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:22,095 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:38:22,095 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:38:22,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:38:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 14:38:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:22,437 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:22,437 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:22,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:22,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:22,437 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:22,437 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:22,437 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1888798654, now seen corresponding path program 299 times [2018-10-04 14:38:22,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:22,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:22,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:22,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:22,523 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:22,532 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:22,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:22,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:22,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:22,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:22,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:22,603 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:23,075 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 14:38:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:23,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:23,076 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:38:23,076 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:38:23,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:38:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 14:38:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:23,382 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:23,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:23,382 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:23,383 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:23,383 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash -115640256, now seen corresponding path program 300 times [2018-10-04 14:38:23,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:23,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:23,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:23,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:23,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:23,469 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:23,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:23,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:23,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:23,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:23,542 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:23,962 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:38:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:23,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:23,963 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:38:23,963 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:38:23,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:38:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-04 14:38:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:24,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:24,303 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:24,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:24,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:24,304 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:24,304 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:24,304 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash -115638334, now seen corresponding path program 301 times [2018-10-04 14:38:24,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:24,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:24,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:24,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:24,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:24,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:24,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:24,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:24,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:24,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:24,575 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:25,011 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 14:38:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:25,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:25,012 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:38:25,012 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:38:25,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:38:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:38:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-10-04 14:38:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:25,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:25,337 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:25,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:25,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:25,337 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:25,338 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:25,338 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash -113793214, now seen corresponding path program 302 times [2018-10-04 14:38:25,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:25,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:25,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:25,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:25,423 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:25,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:25,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:25,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:25,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:25,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:25,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:25,481 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:25,905 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 14:38:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:25,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:25,905 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:38:25,906 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:38:25,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:38:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-04 14:38:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:26,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:26,252 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:26,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:26,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:26,253 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:26,253 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:26,253 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -113791292, now seen corresponding path program 303 times [2018-10-04 14:38:26,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:26,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:26,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:26,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:26,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:26,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:26,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:26,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:26,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:26,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:26,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:26,420 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:26,420 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:26,840 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2018-10-04 14:38:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:26,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:26,841 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:38:26,841 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:38:26,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:38:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-10-04 14:38:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:38:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 14:38:27,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2018-10-04 14:38:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:27,054 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 14:38:27,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 14:38:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:27,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:27,055 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 14:38:27,055 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:27,055 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 330139066, now seen corresponding path program 304 times [2018-10-04 14:38:27,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:27,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:27,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:27,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 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:27,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:27,176 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:27,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:27,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:27,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:27,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:27,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:27,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:27,485 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 11 states. [2018-10-04 14:38:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:28,231 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:28,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:28,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:28,232 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:28,232 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:28,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 14:38:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:38:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:28,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:28,633 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:28,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:28,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:28,634 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:28,634 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:28,634 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 330140988, now seen corresponding path program 305 times [2018-10-04 14:38:28,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:28,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:28,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:28,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:28,718 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:28,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:28,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:28,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:28,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:28,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:28,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:28,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:28,783 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:29,565 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:29,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:29,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:29,566 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:29,566 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:29,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:38:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:29,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:29,933 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:29,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:29,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:29,934 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:29,934 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:29,934 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 331986108, now seen corresponding path program 306 times [2018-10-04 14:38:29,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:29,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:30,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:30,014 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:30,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:30,031 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:30,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:30,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:30,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:30,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:30,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:30,089 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:30,818 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:38:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:30,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:30,819 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:38:30,819 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:38:30,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:38:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:38:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:31,193 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:31,193 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:31,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:31,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:31,193 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:31,193 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:31,193 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash 331988030, now seen corresponding path program 307 times [2018-10-04 14:38:31,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:31,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:31,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:31,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:31,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:31,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:31,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:31,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:31,352 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:32,057 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:32,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:32,058 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:32,058 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:32,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 14:38:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:32,404 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:32,405 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:32,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:32,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:32,405 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:32,405 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:32,405 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2105146428, now seen corresponding path program 308 times [2018-10-04 14:38:32,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:32,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:32,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:32,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:32,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:32,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:32,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:32,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:32,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:32,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:32,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:32,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:32,553 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:33,315 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:33,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:33,316 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:33,316 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:33,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:38:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:33,849 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:33,850 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:33,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:33,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:33,850 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:33,850 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:33,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2105148350, now seen corresponding path program 309 times [2018-10-04 14:38:33,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:33,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:33,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:33,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:33,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:33,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:33,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:33,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:34,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:34,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:34,004 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:34,004 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:34,776 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:34,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:34,777 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:34,777 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:34,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:38:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:35,168 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:35,168 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:35,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:35,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:35,168 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:35,168 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:35,168 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2106993470, now seen corresponding path program 310 times [2018-10-04 14:38:35,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:35,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:35,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:35,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:35,248 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:35,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:35,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:35,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:35,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:35,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:35,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:35,316 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:36,050 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:38:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:36,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:36,051 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:38:36,051 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:38:36,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:38:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:38:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:36,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:36,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:36,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:36,446 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:36,446 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:36,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2106995392, now seen corresponding path program 311 times [2018-10-04 14:38:36,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:36,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:36,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:36,526 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:36,534 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:36,543 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:36,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:36,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:36,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:36,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:36,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:36,845 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:37,553 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:37,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:37,554 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:37,554 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:37,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 14:38:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 14:38:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:38:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:38:37,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:38:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:37,870 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:38:37,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:38:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:37,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:37,871 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:37,871 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:37,871 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1010197436, now seen corresponding path program 312 times [2018-10-04 14:38:37,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:37,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:37,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:37,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:37,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:37,950 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:37,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:37,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:38,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:38,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:38,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:38,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:38,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:38,022 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:38:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:38,730 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:38,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:38,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:38,731 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:38,731 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:38,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:38:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:39,140 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:39,140 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:39,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:39,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:39,140 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:39,140 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:39,140 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1010199358, now seen corresponding path program 313 times [2018-10-04 14:38:39,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:39,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:39,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:39,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:39,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:39,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:39,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:39,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:39,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:39,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:39,273 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:39,946 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:38:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:39,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:39,947 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:38:39,947 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:38:39,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:38:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:38:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:40,346 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:40,346 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:40,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:40,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:40,347 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:40,347 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:40,347 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1012044478, now seen corresponding path program 314 times [2018-10-04 14:38:40,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:40,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:40,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:40,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:40,425 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:40,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:40,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:40,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:40,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:40,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:40,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:40,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:40,482 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:41,191 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:41,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:41,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:41,192 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:41,192 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:41,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:38:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:41,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:41,576 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:41,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:41,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:41,576 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:41,576 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:41,576 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1012046400, now seen corresponding path program 315 times [2018-10-04 14:38:41,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:41,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:41,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:41,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:41,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:41,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:41,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:41,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:41,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:41,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:41,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:41,724 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:42,428 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:38:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:42,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:42,429 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:38:42,429 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:38:42,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:38:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 14:38:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:42,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:42,777 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:42,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:42,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:42,777 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:42,777 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:42,777 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1509762498, now seen corresponding path program 316 times [2018-10-04 14:38:42,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:42,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:42,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:42,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:42,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:42,888 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:42,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:42,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:42,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:42,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:42,949 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:43,613 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:38:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:43,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:43,614 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:38:43,614 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:38:43,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:38:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 14:38:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:44,014 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:44,014 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:44,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:44,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:44,014 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:44,014 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:44,015 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1509760576, now seen corresponding path program 317 times [2018-10-04 14:38:44,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:44,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:44,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:44,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:44,112 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:44,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:44,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:44,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:44,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:44,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:44,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:44,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:44,170 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:44,847 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:38:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:44,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:44,848 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:38:44,848 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:38:44,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:38:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:38:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:45,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:45,245 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:45,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:45,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:45,246 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:45,246 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:45,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1507915456, now seen corresponding path program 318 times [2018-10-04 14:38:45,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:45,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:45,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:45,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:45,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:45,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:45,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:45,330 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:45,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:45,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:45,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:45,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:45,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:45,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:45,400 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:46,027 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:38:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:46,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:46,028 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:38:46,028 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:38:46,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:38:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:38:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:46,416 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:46,416 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:46,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:46,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:46,416 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:46,416 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:46,417 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1507913534, now seen corresponding path program 319 times [2018-10-04 14:38:46,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:46,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:46,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:46,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:46,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:46,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:46,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:46,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:46,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:46,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:46,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:46,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:46,562 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:47,147 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:38:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:47,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:47,148 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:38:47,148 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:38:47,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:38:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 14:38:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:38:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:38:47,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 14:38:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:47,450 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:38:47,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:38:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:47,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:47,450 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:38:47,450 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:47,450 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1031203644, now seen corresponding path program 320 times [2018-10-04 14:38:47,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:47,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:47,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:47,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:47,551 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:47,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:47,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:47,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:47,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:47,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:47,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:47,606 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 14:38:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:48,388 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:48,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:48,389 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:48,389 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:48,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:38:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:48,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:48,788 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:48,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:48,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:48,789 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:48,789 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:48,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1031205566, now seen corresponding path program 321 times [2018-10-04 14:38:48,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:48,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:48,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:48,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:48,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:48,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:48,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:48,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:48,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:48,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:48,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:48,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:48,950 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:49,738 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:49,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:49,739 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:49,739 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:49,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:38:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:50,128 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:50,128 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:50,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:50,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:50,128 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:50,128 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:50,128 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:50,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1033050686, now seen corresponding path program 322 times [2018-10-04 14:38:50,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:50,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:50,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:50,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:50,233 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:50,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:50,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:50,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:50,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:50,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:50,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:50,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:50,306 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:51,050 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:38:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:51,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:51,051 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:38:51,051 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:38:51,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:38:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:38:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:51,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:51,441 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:51,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:51,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:51,441 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:51,441 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:51,441 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1033052608, now seen corresponding path program 323 times [2018-10-04 14:38:51,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:51,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:51,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:51,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:51,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:51,531 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:51,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:51,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:51,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:51,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:51,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:51,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:51,583 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:52,298 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:52,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:52,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:52,299 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:52,299 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:52,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:38:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 14:38:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:38:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:38:52,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:38:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:52,661 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:38:52,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:38:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:52,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:52,662 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:52,662 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:52,662 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1488756290, now seen corresponding path program 324 times [2018-10-04 14:38:52,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:52,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:52,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:52,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:52,725 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:38:52,742 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:38:52,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:52,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:52,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:52,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:52,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:52,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:52,810 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:38:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:53,617 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:53,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:53,618 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:53,618 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:53,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 14:38:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:54,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:54,016 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:54,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:54,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:54,016 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:54,016 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:54,016 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1488754368, now seen corresponding path program 325 times [2018-10-04 14:38:54,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:54,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:54,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:54,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:54,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:54,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:54,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:54,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:54,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:54,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:54,182 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:54,997 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 14:38:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:54,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:54,998 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:38:54,998 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:38:54,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:38:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 14:38:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:38:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:38:55,382 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:38:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:55,383 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:38:55,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:38:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:55,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:55,383 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:55,383 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:55,383 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1486909248, now seen corresponding path program 326 times [2018-10-04 14:38:55,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:55,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:55,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:55,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:38:55,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:55,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:55,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:38:55,491 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:38:55,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:55,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:55,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:55,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:55,549 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:38:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:56,307 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 14:38:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:56,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:56,308 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:38:56,308 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:38:56,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:38:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 14:38:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:56,706 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:56,706 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:56,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:56,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:56,706 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:56,706 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:56,707 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1486907326, now seen corresponding path program 327 times [2018-10-04 14:38:56,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:56,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:56,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:56,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:56,779 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:38:56,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:38:56,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:56,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:56,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:56,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:56,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:56,912 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:38:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:57,617 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:57,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:57,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:57,618 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:57,618 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:57,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 14:38:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:38:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:38:57,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:38:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:57,951 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:38:57,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:38:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:57,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:57,952 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:38:57,952 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:57,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1711262014, now seen corresponding path program 328 times [2018-10-04 14:38:57,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:57,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:58,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:58,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:58,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:38:58,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:38:58,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:58,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:58,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:58,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:58,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:58,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:58,101 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:38:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:38:58,825 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:38:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:38:58,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:38:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:38:58,826 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:38:58,826 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:38:58,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:38:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:38:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:38:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:38:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:38:59,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:38:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:38:59,223 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:38:59,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:38:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:38:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:38:59,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:38:59,223 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:38:59,223 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:38:59,224 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:38:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1711263936, now seen corresponding path program 329 times [2018-10-04 14:38:59,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:38:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:38:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:59,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:38:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:38:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:38:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:59,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:38:59,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:38:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:38:59,423 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:38:59,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:38:59,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:38:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:38:59,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:38:59,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:38:59,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:38:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:38:59,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:38:59,468 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:00,161 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:00,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:00,162 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:00,162 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:00,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 14:39:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 14:39:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:00,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:00,547 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:00,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:00,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:00,547 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:00,548 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:00,548 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:00,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1713109056, now seen corresponding path program 330 times [2018-10-04 14:39:00,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:00,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:00,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:00,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:00,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:00,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:00,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:00,695 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:39:00,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:00,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:00,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:00,744 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:01,471 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 14:39:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:01,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:01,472 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:39:01,472 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:39:01,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:39:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 14:39:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:01,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:01,867 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:01,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:01,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:01,867 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:01,867 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:01,867 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1713110978, now seen corresponding path program 331 times [2018-10-04 14:39:01,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:01,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:01,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:01,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:01,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:01,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:01,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:02,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:02,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:02,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:02,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:02,012 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:02,711 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:02,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:02,712 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:02,712 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:02,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 14:39:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:39:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:39:03,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:39:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:03,080 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:39:03,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:39:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:03,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:03,080 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:03,081 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:03,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash -808697920, now seen corresponding path program 332 times [2018-10-04 14:39:03,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:03,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:03,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:03,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:03,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:03,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:03,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:03,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:03,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:03,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:03,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:03,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:03,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:03,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:03,233 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:39:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:03,905 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:03,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:03,906 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:03,906 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:03,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 14:39:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:04,306 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:04,307 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:04,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:04,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:04,307 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:04,307 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:04,307 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash -808695998, now seen corresponding path program 333 times [2018-10-04 14:39:04,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:04,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:04,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:04,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:04,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:04,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:39:04,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:39:04,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:04,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:04,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:04,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:04,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:04,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:04,452 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:05,122 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:05,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:05,123 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:05,123 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:05,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:39:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:05,521 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:05,521 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:05,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:05,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:05,521 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:05,522 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:05,522 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -806850878, now seen corresponding path program 334 times [2018-10-04 14:39:05,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:05,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:05,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:05,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:05,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:05,667 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:05,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:05,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:05,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:05,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:05,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:05,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:05,711 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:05,711 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:06,369 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:39:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:06,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:06,370 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:39:06,370 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:39:06,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:39:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:39:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:06,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:06,768 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:06,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:06,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:06,768 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:39:06,769 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:06,769 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -806848956, now seen corresponding path program 335 times [2018-10-04 14:39:06,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:06,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:06,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:06,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:06,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:06,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:06,971 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:39:06,980 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:39:06,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:06,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:07,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:07,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:07,028 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:07,028 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:07,640 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:07,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:07,641 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:07,641 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:07,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:39:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:39:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 14:39:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:39:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 14:39:07,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 14:39:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:07,910 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 14:39:07,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 14:39:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:07,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:07,910 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:39:07,911 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:07,911 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:07,911 INFO L82 PathProgramCache]: Analyzing trace with hash -256666948, now seen corresponding path program 336 times [2018-10-04 14:39:07,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:07,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:07,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:07,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:07,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:07,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:07,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:08,009 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:39:08,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:08,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:08,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:08,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:08,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:08,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:08,061 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 14:39:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:08,756 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:08,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:08,757 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:08,757 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:08,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:39:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:09,178 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:09,178 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:09,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:09,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:09,178 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:09,179 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:09,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash -256665026, now seen corresponding path program 337 times [2018-10-04 14:39:09,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:09,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:09,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:09,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:09,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:09,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:09,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:09,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:09,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:09,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:09,338 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:10,040 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:10,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:10,041 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:10,041 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:10,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:39:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:10,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:10,451 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:10,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:10,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:10,452 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:10,452 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:10,452 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash -254819906, now seen corresponding path program 338 times [2018-10-04 14:39:10,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:10,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:10,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:10,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:10,559 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:10,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:10,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:10,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:10,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:10,634 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:11,366 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:11,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:11,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:11,367 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:11,367 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:11,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:39:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:11,783 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:11,784 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:11,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:11,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:11,784 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:11,784 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:11,784 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash -254817984, now seen corresponding path program 339 times [2018-10-04 14:39:11,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:11,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:11,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:11,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:11,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:11,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:39:11,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:39:11,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:11,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:11,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:11,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:11,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:11,936 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:12,629 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:12,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:12,630 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:12,630 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:12,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:39:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:39:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:39:13,018 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:39:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:13,018 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:39:13,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:39:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:13,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:13,019 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:13,019 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:13,019 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1518340414, now seen corresponding path program 340 times [2018-10-04 14:39:13,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:13,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:13,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:13,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:13,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:13,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:13,147 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:13,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:13,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:13,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:13,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:13,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:13,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:13,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:13,244 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:39:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:13,902 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:39:13,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:13,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:13,903 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:39:13,903 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:39:13,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:39:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:39:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:14,321 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:14,321 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:14,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:14,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:14,321 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:14,322 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:14,322 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1518342336, now seen corresponding path program 341 times [2018-10-04 14:39:14,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:14,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:14,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:14,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:39:14,411 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:39:14,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:14,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:14,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:14,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:14,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:14,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:14,460 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:15,121 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:39:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:15,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:15,122 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:39:15,122 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:39:15,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:39:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:39:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:15,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:15,553 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:15,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:15,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:15,553 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:15,553 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:15,553 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1520187456, now seen corresponding path program 342 times [2018-10-04 14:39:15,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:15,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:15,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:15,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:15,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:15,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:15,697 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:39:15,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:15,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:15,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:15,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:15,743 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:16,378 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:16,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:16,379 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:16,379 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:16,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:39:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:39:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:16,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:16,794 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:16,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:16,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:16,794 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:16,795 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:16,795 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1520189378, now seen corresponding path program 343 times [2018-10-04 14:39:16,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:16,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:16,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:16,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:16,869 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:16,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:16,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:16,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:16,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:16,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:16,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:16,939 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:17,557 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:39:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:17,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:17,558 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:39:17,558 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:39:17,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:39:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 14:39:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 14:39:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 14:39:17,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 14:39:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 14:39:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 14:39:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:17,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:17,911 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:17,911 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:17,911 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 423391422, now seen corresponding path program 344 times [2018-10-04 14:39:17,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:17,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:17,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:17,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:17,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:17,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:17,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:18,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:18,059 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 14:39:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:18,779 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:18,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:18,780 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:18,780 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:18,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:39:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:19,202 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:19,202 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:19,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:19,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:19,202 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:19,203 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:19,203 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 423393344, now seen corresponding path program 345 times [2018-10-04 14:39:19,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:19,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:19,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:19,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:39:19,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:39:19,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:19,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:19,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:19,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:19,362 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:20,068 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:20,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:20,069 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:20,069 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:20,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 14:39:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:20,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:20,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:20,478 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:20,478 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:20,478 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 425238464, now seen corresponding path program 346 times [2018-10-04 14:39:20,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:20,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:20,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:20,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:20,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:20,554 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:20,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:20,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:20,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:20,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:20,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:20,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:20,691 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:21,429 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 14:39:21,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:21,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:21,430 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:39:21,430 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:39:21,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:39:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 14:39:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:21,849 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:21,849 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:21,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:21,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:21,849 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:21,850 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:21,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:21,850 INFO L82 PathProgramCache]: Analyzing trace with hash 425240386, now seen corresponding path program 347 times [2018-10-04 14:39:21,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:21,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:21,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:21,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:21,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:21,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:21,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:39:21,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:39:21,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:21,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:21,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:21,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:21,986 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:22,689 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 14:39:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:22,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:22,690 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:39:22,690 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:39:22,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:39:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 14:39:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:39:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:39:23,075 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:39:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:23,075 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:39:23,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:39:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:23,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:23,076 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:23,076 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:23,076 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2096568512, now seen corresponding path program 348 times [2018-10-04 14:39:23,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:23,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:23,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:23,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:23,131 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:23,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:23,172 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:39:23,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:23,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:23,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:23,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:23,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:23,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:23,238 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:39:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:23,900 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:39:23,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:23,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:23,901 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:39:23,901 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:39:23,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:39:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 14:39:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:24,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:24,325 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:24,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:24,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:24,325 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:24,325 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:24,326 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2096566590, now seen corresponding path program 349 times [2018-10-04 14:39:24,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:24,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:24,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:24,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:24,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:24,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:24,458 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:25,124 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 14:39:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:25,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:25,125 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:39:25,125 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:39:25,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:39:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 14:39:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:25,540 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:25,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:25,541 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:25,541 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:25,541 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2094721470, now seen corresponding path program 350 times [2018-10-04 14:39:25,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:25,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:25,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:25,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:25,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:25,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:25,612 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:25,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:25,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:25,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:25,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:25,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:25,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:25,669 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:26,294 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:26,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:26,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:26,294 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:26,295 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:26,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:39:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:39:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:26,722 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:26,722 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:26,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:26,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:26,722 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:39:26,722 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:26,722 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2094719548, now seen corresponding path program 351 times [2018-10-04 14:39:26,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:26,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:26,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:26,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:26,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:26,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:39:26,802 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:39:26,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:26,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:26,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:26,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:26,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:26,859 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:27,468 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:39:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:27,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:27,469 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:39:27,469 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:39:27,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:39:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 14:39:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:39:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 14:39:27,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 14:39:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:27,789 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 14:39:27,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 14:39:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:27,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:27,789 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:27,789 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:27,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 444397630, now seen corresponding path program 352 times [2018-10-04 14:39:27,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:27,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:27,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:27,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:27,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:27,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:39:27,862 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:39:27,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:27,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:27,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:27,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:27,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:27,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:27,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:27,917 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 14:39:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:28,562 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:28,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:28,563 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:28,563 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:28,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:39:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:39:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:29,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:29,001 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:29,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:29,002 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:29,002 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:29,002 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 444399552, now seen corresponding path program 353 times [2018-10-04 14:39:29,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:29,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:29,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:29,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:29,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:39:29,085 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:39:29,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:29,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:29,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:29,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:29,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:29,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:29,175 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:29,799 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:29,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:29,800 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:29,800 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:29,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:39:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 14:39:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 14:39:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 14:39:30,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 14:39:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:30,228 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 14:39:30,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 14:39:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:30,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:30,229 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:30,229 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:30,229 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 446244672, now seen corresponding path program 354 times [2018-10-04 14:39:30,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:30,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:30,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:30,302 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:39:30,312 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 14:39:30,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:30,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:30,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:30,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:30,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:30,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:30,372 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 14:39:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:30,980 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 14:39:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:30,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:30,980 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:39:30,981 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:39:30,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:39:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 14:39:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 14:39:31,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 14:39:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:31,410 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 14:39:31,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 14:39:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:31,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:31,410 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 14:39:31,410 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:31,410 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:31,410 INFO L82 PathProgramCache]: Analyzing trace with hash 446246594, now seen corresponding path program 355 times [2018-10-04 14:39:31,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:31,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:31,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:39:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:31,476 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:31,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:31,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:31,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:31,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:31,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:31,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:31,560 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 14:39:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:32,158 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 14:39:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:32,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:32,159 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:39:32,159 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:39:32,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:39:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:39:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 14:39:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:39:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 14:39:32,560 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 14:39:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:39:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 14:39:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:39:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 14:39:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:39:32,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:39:32,561 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 14:39:32,561 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:39:32,561 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:39:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2075562304, now seen corresponding path program 356 times [2018-10-04 14:39:32,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:39:32,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:39:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:39:32,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:39:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:39:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:32,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:39:32,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:39:32,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:39:32,634 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:39:32,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:39:32,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:39:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:39:32,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:39:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:39:32,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:39:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:39:32,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:39:32,702 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 14:39:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:39:33,333 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 14:39:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:39:33,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 14:39:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:39:33,334 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:39:33,334 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:39:33,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 14:39:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. Received shutdown request... [2018-10-04 14:39:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 14:39:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:39:33,775 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:39:33,781 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:39:33,781 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:39:33 BoogieIcfgContainer [2018-10-04 14:39:33,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:39:33,782 INFO L168 Benchmark]: Toolchain (without parser) took 257700.98 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 428.8 MB). Peak memory consumption was 131.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:39:33,784 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:39:33,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:39:33,784 INFO L168 Benchmark]: Boogie Preprocessor took 26.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:39:33,784 INFO L168 Benchmark]: RCFGBuilder took 253.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 14:39:33,785 INFO L168 Benchmark]: TraceAbstraction took 257372.85 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 407.6 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:39:33,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 253.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 257372.85 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 407.6 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 257.3s OverallTime, 372 OverallIterations, 8 TraceHistogramMax, 122.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1490 SDtfs, 2848 SDslu, 5030 SDs, 0 SdLazy, 8554 SolverSat, 4852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8908 GetRequests, 6062 SyntacticMatches, 0 SemanticMatches, 2846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=256, 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: 63.4s AutomataMinimizationTime, 372 MinimizatonAttempts, 5551 StatesRemovedByMinimization, 371 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 54.9s InterpolantComputationTime, 12125 NumberOfCodeBlocks, 12125 NumberOfCodeBlocksAsserted, 2096 NumberOfCheckSat, 11382 ConstructedInterpolants, 0 QuantifiedInterpolants, 517944 SizeOfPredicates, 371 NumberOfNonLiveVariables, 15709 ConjunctsInSsa, 3216 ConjunctsInUnsatCore, 743 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34420 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/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-39-33-795.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-39-33-795.csv Completed graceful shutdown