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/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:40:52,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:52,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:52,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:52,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:52,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:52,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:52,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:52,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:52,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:52,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:52,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:52,063 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:52,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:52,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:52,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:52,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:52,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:52,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:52,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:52,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:52,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:52,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:52,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:52,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:52,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:52,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:52,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:52,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:52,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:52,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:52,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:52,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:52,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:52,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:52,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:52,110 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-09-26 21:40:52,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:52,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:52,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:52,140 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:52,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:52,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:52,141 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:52,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:52,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:52,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:52,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:52,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:52,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:52,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:52,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:52,144 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:52,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:52,144 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:52,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:52,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:52,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:52,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:52,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:52,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:52,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:52,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:52,147 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:52,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:52,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:52,148 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:52,148 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:52,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:52,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:52,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:52,239 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:52,240 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:52,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-26 21:40:52,241 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-26 21:40:52,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:52,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:52,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:52,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:52,307 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:52,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,344 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:52,344 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:52,345 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:52,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:52,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:52,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:52,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:52,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/1) ... [2018-09-26 21:40:52,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:52,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:52,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:52,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:52,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (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-09-26 21:40:52,448 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:40:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:40:52,449 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:40:52,752 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:52,753 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:52 BoogieIcfgContainer [2018-09-26 21:40:52,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:52,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:52,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:52,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:52,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:52" (1/2) ... [2018-09-26 21:40:52,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b780738 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:52, skipping insertion in model container [2018-09-26 21:40:52,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:52" (2/2) ... [2018-09-26 21:40:52,776 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-26 21:40:52,790 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:52,799 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 21:40:52,904 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:52,907 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:52,907 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:52,907 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:52,907 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:52,908 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:52,908 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:52,908 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:52,908 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-26 21:40:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:40:52,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:52,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:40:52,946 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:52,952 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-26 21:40:52,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:52,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:53,204 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:53,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:53,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:53,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:53,226 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-26 21:40:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:54,774 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-26 21:40:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:54,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 21:40:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:54,793 INFO L225 Difference]: With dead ends: 32 [2018-09-26 21:40:54,793 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:40:54,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:40:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-26 21:40:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 21:40:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-26 21:40:54,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-26 21:40:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:54,838 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-26 21:40:54,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-26 21:40:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:40:54,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:54,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:40:54,840 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:54,840 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-26 21:40:54,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:54,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:54,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:54,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:54,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:54,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:54,907 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-26 21:40:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:55,526 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-26 21:40:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:55,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 21:40:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:55,531 INFO L225 Difference]: With dead ends: 38 [2018-09-26 21:40:55,531 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 21:40:55,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 21:40:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-26 21:40:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:40:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-26 21:40:55,540 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-26 21:40:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:55,540 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-26 21:40:55,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-26 21:40:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:55,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:55,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:55,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:55,542 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-26 21:40:55,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:55,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:55,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:55,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:55,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:55,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:55,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:55,659 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-26 21:40:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:56,784 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-26 21:40:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:40:56,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 21:40:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:56,792 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:40:56,792 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 21:40:56,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 21:40:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-26 21:40:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:40:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-26 21:40:56,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-26 21:40:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:56,813 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-26 21:40:56,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:40:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-26 21:40:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:56,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:56,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:56,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:56,815 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-26 21:40:56,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:56,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:56,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:56,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:56,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:56,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:56,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:56,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:56,903 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-26 21:40:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:57,578 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-26 21:40:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:40:57,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 21:40:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:57,581 INFO L225 Difference]: With dead ends: 54 [2018-09-26 21:40:57,581 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 21:40:57,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 21:40:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-26 21:40:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 21:40:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-26 21:40:57,593 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-26 21:40:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:57,594 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-26 21:40:57,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:40:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-26 21:40:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:40:57,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:57,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:57,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:57,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-26 21:40:57,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:57,725 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:57,726 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-09-26 21:40:57,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:57,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:58,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:58,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:40:58,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:58,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:58,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:58,435 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-09-26 21:41:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:01,732 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-09-26 21:41:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:41:01,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-09-26 21:41:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:01,734 INFO L225 Difference]: With dead ends: 107 [2018-09-26 21:41:01,734 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 21:41:01,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 21:41:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-09-26 21:41:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 21:41:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-09-26 21:41:01,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-09-26 21:41:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:01,751 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-09-26 21:41:01,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-09-26 21:41:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:01,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:01,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:01,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:01,752 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-26 21:41:01,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:01,853 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:01,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:01,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:01,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:01,855 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-09-26 21:41:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:03,113 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-09-26 21:41:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:03,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:03,116 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:41:03,116 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 21:41:03,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 21:41:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-26 21:41:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:41:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-09-26 21:41:03,132 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-09-26 21:41:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:03,133 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-09-26 21:41:03,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-09-26 21:41:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:03,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:03,134 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:03,134 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:03,134 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-26 21:41:03,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:03,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:03,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:03,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:03,212 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:03,212 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-09-26 21:41:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:03,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:03,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:03,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-26 21:41:03,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:03,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:03,672 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-09-26 21:41:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:08,407 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-09-26 21:41:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:41:08,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-26 21:41:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:08,412 INFO L225 Difference]: With dead ends: 150 [2018-09-26 21:41:08,412 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 21:41:08,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 21:41:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-09-26 21:41:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 21:41:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-09-26 21:41:08,435 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-09-26 21:41:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:08,435 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-09-26 21:41:08,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-09-26 21:41:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:08,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:08,437 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:08,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:08,439 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-26 21:41:08,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:08,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:08,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:08,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:08,507 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-09-26 21:41:08,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:08,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:08,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:08,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-09-26 21:41:08,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:08,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:08,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:08,701 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-09-26 21:41:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:11,743 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-26 21:41:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:41:11,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-26 21:41:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:11,744 INFO L225 Difference]: With dead ends: 137 [2018-09-26 21:41:11,745 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:41:11,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:41:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-26 21:41:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 21:41:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-26 21:41:11,767 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-26 21:41:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:11,767 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-26 21:41:11,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-26 21:41:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:11,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:11,769 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:11,769 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:11,769 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-26 21:41:11,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:11,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:11,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:11,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:12,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:12,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-26 21:41:12,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:41:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:41:12,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:12,089 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-09-26 21:41:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:15,047 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-09-26 21:41:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:15,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-09-26 21:41:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:15,049 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:41:15,049 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 21:41:15,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 21:41:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-09-26 21:41:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 21:41:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-09-26 21:41:15,080 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-09-26 21:41:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:15,080 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-09-26 21:41:15,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:41:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-09-26 21:41:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:15,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:15,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:15,082 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:15,082 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-26 21:41:15,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:15,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:15,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:15,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 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-09-26 21:41:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:15,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:15,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:41:15,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:41:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:41:15,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:15,294 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-09-26 21:41:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:17,571 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-09-26 21:41:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:17,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-09-26 21:41:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:17,580 INFO L225 Difference]: With dead ends: 246 [2018-09-26 21:41:17,581 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 21:41:17,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 21:41:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-09-26 21:41:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 21:41:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-09-26 21:41:17,616 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-09-26 21:41:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:17,617 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-09-26 21:41:17,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:41:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-09-26 21:41:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:17,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:17,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:17,619 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:17,619 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-26 21:41:17,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:17,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:17,686 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:17,686 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-09-26 21:41:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:17,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:17,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:17,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:41:17,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:17,765 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:17,765 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-09-26 21:41:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:18,755 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-09-26 21:41:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:41:18,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:41:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:18,762 INFO L225 Difference]: With dead ends: 252 [2018-09-26 21:41:18,762 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 21:41:18,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 21:41:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-09-26 21:41:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 21:41:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-09-26 21:41:18,792 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-09-26 21:41:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:18,792 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-09-26 21:41:18,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-09-26 21:41:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:18,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:18,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:18,794 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:18,795 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-26 21:41:18,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:18,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:18,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:18,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:18,866 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-09-26 21:41:18,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:18,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:18,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:18,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-26 21:41:18,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:41:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:41:18,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:18,959 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-09-26 21:41:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:20,228 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-09-26 21:41:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:41:20,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-26 21:41:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:20,234 INFO L225 Difference]: With dead ends: 260 [2018-09-26 21:41:20,234 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 21:41:20,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 21:41:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-09-26 21:41:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 21:41:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-09-26 21:41:20,276 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-09-26 21:41:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:20,276 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-09-26 21:41:20,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:41:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-09-26 21:41:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:20,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:20,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:20,278 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:20,278 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-26 21:41:20,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:20,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:20,352 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:20,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:41:20,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:20,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:20,353 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-09-26 21:41:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:21,620 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-09-26 21:41:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:41:21,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:41:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:21,623 INFO L225 Difference]: With dead ends: 316 [2018-09-26 21:41:21,623 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 21:41:21,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 21:41:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-09-26 21:41:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 21:41:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-09-26 21:41:21,659 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-09-26 21:41:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:21,660 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-09-26 21:41:21,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-09-26 21:41:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:21,660 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:21,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:21,661 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:21,661 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-26 21:41:21,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:21,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:21,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:21,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 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-09-26 21:41:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:21,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:21,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:21,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:41:21,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:21,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:21,791 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-09-26 21:41:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:22,523 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-09-26 21:41:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:41:22,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:41:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:22,528 INFO L225 Difference]: With dead ends: 428 [2018-09-26 21:41:22,529 INFO L226 Difference]: Without dead ends: 426 [2018-09-26 21:41:22,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-09-26 21:41:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-09-26 21:41:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 21:41:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-09-26 21:41:22,595 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-09-26 21:41:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:22,596 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-09-26 21:41:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-09-26 21:41:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:22,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:22,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:22,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:22,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-26 21:41:22,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:22,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:22,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:22,761 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-09-26 21:41:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:22,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:22,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:22,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-26 21:41:22,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:41:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:41:22,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:22,847 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-09-26 21:41:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:25,803 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-09-26 21:41:25,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:25,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-26 21:41:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:25,806 INFO L225 Difference]: With dead ends: 466 [2018-09-26 21:41:25,807 INFO L226 Difference]: Without dead ends: 464 [2018-09-26 21:41:25,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-26 21:41:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-09-26 21:41:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 21:41:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-09-26 21:41:25,877 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-09-26 21:41:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:25,877 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-09-26 21:41:25,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:41:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-09-26 21:41:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:25,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:25,878 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:25,879 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:25,879 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-26 21:41:25,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:25,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:25,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:25,984 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-09-26 21:41:25,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:26,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:26,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:41:26,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-09-26 21:41:26,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:26,148 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:26,149 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-09-26 21:41:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:32,160 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-09-26 21:41:32,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:41:32,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-09-26 21:41:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:32,164 INFO L225 Difference]: With dead ends: 859 [2018-09-26 21:41:32,164 INFO L226 Difference]: Without dead ends: 509 [2018-09-26 21:41:32,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-09-26 21:41:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-09-26 21:41:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-26 21:41:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-09-26 21:41:32,266 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-09-26 21:41:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:32,266 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-09-26 21:41:32,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-09-26 21:41:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:32,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:32,267 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:32,268 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:32,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-26 21:41:32,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:32,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:32,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:32,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:32,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:32,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:32,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:32,525 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-09-26 21:41:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:33,913 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-09-26 21:41:33,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:41:33,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 21:41:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:33,915 INFO L225 Difference]: With dead ends: 481 [2018-09-26 21:41:33,915 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 21:41:33,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 21:41:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-09-26 21:41:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 21:41:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-09-26 21:41:34,023 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-09-26 21:41:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:34,024 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-09-26 21:41:34,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-09-26 21:41:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:34,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:34,029 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:34,030 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:34,030 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-09-26 21:41:34,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:34,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:34,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:34,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:34,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:34,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:34,317 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-09-26 21:41:34,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:34,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:34,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:34,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-26 21:41:34,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:34,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:34,485 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-09-26 21:41:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:37,874 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-09-26 21:41:37,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:41:37,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-26 21:41:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:37,878 INFO L225 Difference]: With dead ends: 952 [2018-09-26 21:41:37,878 INFO L226 Difference]: Without dead ends: 559 [2018-09-26 21:41:37,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-26 21:41:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-09-26 21:41:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 21:41:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-09-26 21:41:37,980 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-09-26 21:41:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:37,980 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-09-26 21:41:37,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-09-26 21:41:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:37,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:37,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:37,982 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:37,982 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-26 21:41:37,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:37,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:37,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:38,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:38,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:38,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:38,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:38,099 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-09-26 21:41:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:39,218 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-09-26 21:41:39,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:41:39,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 21:41:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:39,220 INFO L225 Difference]: With dead ends: 524 [2018-09-26 21:41:39,221 INFO L226 Difference]: Without dead ends: 522 [2018-09-26 21:41:39,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-26 21:41:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-09-26 21:41:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-26 21:41:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-09-26 21:41:39,317 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-09-26 21:41:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:39,317 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-09-26 21:41:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-09-26 21:41:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:39,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:39,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:39,319 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:39,319 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-26 21:41:39,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:39,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:39,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:39,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:39,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:39,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:39,745 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-09-26 21:41:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:39,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:39,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:39,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-26 21:41:39,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:41:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:41:39,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:39,824 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-09-26 21:41:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:41,113 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-09-26 21:41:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:41:41,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 21:41:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:41,115 INFO L225 Difference]: With dead ends: 556 [2018-09-26 21:41:41,115 INFO L226 Difference]: Without dead ends: 554 [2018-09-26 21:41:41,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-26 21:41:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-09-26 21:41:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-26 21:41:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-09-26 21:41:41,208 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-09-26 21:41:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:41,208 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-09-26 21:41:41,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:41:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-09-26 21:41:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:41,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:41,209 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:41,209 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:41,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-26 21:41:41,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:41,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:41,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:41,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:41,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 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-09-26 21:41:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:41,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:41,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:41,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-09-26 21:41:41,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:41,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:41,426 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-09-26 21:41:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:45,273 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-09-26 21:41:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:45,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-26 21:41:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:45,277 INFO L225 Difference]: With dead ends: 631 [2018-09-26 21:41:45,277 INFO L226 Difference]: Without dead ends: 629 [2018-09-26 21:41:45,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-26 21:41:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-09-26 21:41:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-09-26 21:41:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-09-26 21:41:45,375 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-09-26 21:41:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:45,375 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-09-26 21:41:45,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-09-26 21:41:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:45,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:45,376 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:45,376 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:45,376 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-26 21:41:45,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:45,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:45,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:45,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:45,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:45,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:45,456 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-09-26 21:41:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:41:45,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:41:45,472 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:41:45,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:45,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:45,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:41:45,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:45,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:45,521 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-09-26 21:41:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:46,746 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-09-26 21:41:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:41:46,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:41:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:46,750 INFO L225 Difference]: With dead ends: 601 [2018-09-26 21:41:46,750 INFO L226 Difference]: Without dead ends: 599 [2018-09-26 21:41:46,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-26 21:41:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-09-26 21:41:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-26 21:41:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-09-26 21:41:46,856 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-09-26 21:41:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:46,856 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-09-26 21:41:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-09-26 21:41:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:46,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:46,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:46,857 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:46,858 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-26 21:41:46,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:46,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:41:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:46,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:46,927 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-09-26 21:41:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:46,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:46,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:46,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:41:46,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:46,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:46,995 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-09-26 21:41:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:48,589 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-09-26 21:41:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:41:48,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:41:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:48,592 INFO L225 Difference]: With dead ends: 624 [2018-09-26 21:41:48,592 INFO L226 Difference]: Without dead ends: 622 [2018-09-26 21:41:48,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-09-26 21:41:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-09-26 21:41:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-09-26 21:41:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-09-26 21:41:48,715 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-09-26 21:41:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:48,715 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-09-26 21:41:48,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-09-26 21:41:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:48,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:48,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:48,716 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:48,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-26 21:41:48,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:49,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:49,042 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-09-26 21:41:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:49,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:49,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:49,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:41:49,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:49,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:49,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:49,127 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-09-26 21:41:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:50,137 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-09-26 21:41:50,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:41:50,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:41:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:50,139 INFO L225 Difference]: With dead ends: 584 [2018-09-26 21:41:50,139 INFO L226 Difference]: Without dead ends: 582 [2018-09-26 21:41:50,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-26 21:41:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-09-26 21:41:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-26 21:41:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-09-26 21:41:50,252 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-09-26 21:41:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:50,252 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-09-26 21:41:50,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-09-26 21:41:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:50,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:50,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:50,254 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:50,254 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-26 21:41:50,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:50,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:50,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:50,344 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-09-26 21:41:50,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:50,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:50,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:50,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:41:50,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:50,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:50,406 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-09-26 21:41:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:51,707 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-09-26 21:41:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:51,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:41:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:51,710 INFO L225 Difference]: With dead ends: 618 [2018-09-26 21:41:51,711 INFO L226 Difference]: Without dead ends: 616 [2018-09-26 21:41:51,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-09-26 21:41:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-09-26 21:41:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-09-26 21:41:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-09-26 21:41:51,814 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-09-26 21:41:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:51,814 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-09-26 21:41:51,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-09-26 21:41:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:41:51,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:51,815 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:51,815 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:51,815 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-26 21:41:51,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:51,893 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:51,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 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-09-26 21:41:51,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:51,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:51,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:51,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:41:51,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:41:51,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:41:51,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:51,959 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-09-26 21:41:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:53,603 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-09-26 21:41:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:41:53,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:41:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:53,606 INFO L225 Difference]: With dead ends: 613 [2018-09-26 21:41:53,606 INFO L226 Difference]: Without dead ends: 611 [2018-09-26 21:41:53,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-26 21:41:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-09-26 21:41:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-26 21:41:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-09-26 21:41:53,711 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-09-26 21:41:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:53,711 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-09-26 21:41:53,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:41:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-09-26 21:41:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:53,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:53,712 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:53,713 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:53,713 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-26 21:41:53,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:53,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:53,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:53,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:53,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:41:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:53,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:53,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:53,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-26 21:41:53,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:53,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:53,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:53,977 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 14 states. [2018-09-26 21:41:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:57,133 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-09-26 21:41:57,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:57,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-09-26 21:41:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:57,137 INFO L225 Difference]: With dead ends: 875 [2018-09-26 21:41:57,137 INFO L226 Difference]: Without dead ends: 873 [2018-09-26 21:41:57,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-09-26 21:41:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-09-26 21:41:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 21:41:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-09-26 21:41:57,290 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-09-26 21:41:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:57,290 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-09-26 21:41:57,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-09-26 21:41:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:57,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:57,291 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:57,291 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:57,292 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:57,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-26 21:41:57,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:57,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:57,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:57,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:57,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:57,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:57,387 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-09-26 21:41:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:57,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:57,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:57,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-26 21:41:57,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:57,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:57,540 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-09-26 21:42:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:01,766 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-09-26 21:42:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:42:01,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 21:42:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:01,771 INFO L225 Difference]: With dead ends: 1281 [2018-09-26 21:42:01,771 INFO L226 Difference]: Without dead ends: 1279 [2018-09-26 21:42:01,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-09-26 21:42:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-09-26 21:42:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-26 21:42:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-26 21:42:01,964 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-09-26 21:42:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:01,965 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-26 21:42:01,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:42:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-26 21:42:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:42:01,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:01,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:01,966 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:01,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-26 21:42:01,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:01,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:02,114 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:02,114 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-09-26 21:42:02,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:02,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:02,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:02,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:42:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:42:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:42:02,199 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:02,200 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-09-26 21:42:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:04,458 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-09-26 21:42:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:42:04,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-26 21:42:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:04,462 INFO L225 Difference]: With dead ends: 1054 [2018-09-26 21:42:04,462 INFO L226 Difference]: Without dead ends: 1052 [2018-09-26 21:42:04,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-09-26 21:42:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-09-26 21:42:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-26 21:42:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-09-26 21:42:04,657 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-09-26 21:42:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:04,657 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-09-26 21:42:04,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:42:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-09-26 21:42:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:42:04,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:04,658 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:04,659 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:04,659 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-09-26 21:42:04,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:04,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:04,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:04,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:04,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:04,907 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:04,907 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:42:04,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:42:04,921 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:42:04,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:42:04,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:05,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:05,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-09-26 21:42:05,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:05,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:05,099 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 14 states. [2018-09-26 21:42:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:09,519 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-09-26 21:42:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:42:09,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 21:42:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:09,524 INFO L225 Difference]: With dead ends: 1125 [2018-09-26 21:42:09,524 INFO L226 Difference]: Without dead ends: 1123 [2018-09-26 21:42:09,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-26 21:42:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-09-26 21:42:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-26 21:42:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-26 21:42:09,722 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-09-26 21:42:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:09,722 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-26 21:42:09,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-26 21:42:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:42:09,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:09,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:09,724 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:09,724 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-09-26 21:42:09,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:09,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:09,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:42:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:09,865 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:09,866 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-09-26 21:42:09,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:09,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:10,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:10,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-26 21:42:10,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:10,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:10,057 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-09-26 21:42:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:14,587 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-09-26 21:42:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:42:14,588 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 21:42:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:14,592 INFO L225 Difference]: With dead ends: 1125 [2018-09-26 21:42:14,592 INFO L226 Difference]: Without dead ends: 1123 [2018-09-26 21:42:14,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-26 21:42:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-09-26 21:42:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-09-26 21:42:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-09-26 21:42:14,771 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-09-26 21:42:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:14,771 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-09-26 21:42:14,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-09-26 21:42:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:42:14,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:14,772 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:14,772 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:14,773 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-26 21:42:14,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:14,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:14,869 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:14,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 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-09-26 21:42:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:14,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:14,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:14,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-09-26 21:42:14,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:42:14,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:42:14,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:14,954 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-09-26 21:42:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:17,312 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-09-26 21:42:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:42:17,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-26 21:42:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:17,316 INFO L225 Difference]: With dead ends: 1117 [2018-09-26 21:42:17,316 INFO L226 Difference]: Without dead ends: 1115 [2018-09-26 21:42:17,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-09-26 21:42:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-09-26 21:42:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-09-26 21:42:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-09-26 21:42:17,510 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-09-26 21:42:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:17,510 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-09-26 21:42:17,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:42:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-09-26 21:42:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:42:17,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:17,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:17,512 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:17,512 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-26 21:42:17,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:17,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:17,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:17,647 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:17,647 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-09-26 21:42:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:17,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:17,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:17,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:42:17,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:42:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:42:17,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:17,754 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-09-26 21:42:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:19,707 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-09-26 21:42:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:42:19,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-26 21:42:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:19,711 INFO L225 Difference]: With dead ends: 995 [2018-09-26 21:42:19,711 INFO L226 Difference]: Without dead ends: 993 [2018-09-26 21:42:19,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-09-26 21:42:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-09-26 21:42:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-09-26 21:42:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-09-26 21:42:19,910 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-09-26 21:42:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:19,910 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-09-26 21:42:19,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:42:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-09-26 21:42:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:19,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:19,912 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:42:19,912 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:19,912 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-09-26 21:42:19,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:19,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:20,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:20,743 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:42:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:20,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:20,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:20,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-26 21:42:20,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:42:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:42:20,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:20,967 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-09-26 21:42:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:29,160 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-09-26 21:42:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:42:29,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-26 21:42:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:29,165 INFO L225 Difference]: With dead ends: 2105 [2018-09-26 21:42:29,165 INFO L226 Difference]: Without dead ends: 1229 [2018-09-26 21:42:29,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-09-26 21:42:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-09-26 21:42:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-09-26 21:42:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-09-26 21:42:29,388 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-09-26 21:42:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:29,389 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-09-26 21:42:29,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:42:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-09-26 21:42:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:29,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:29,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:29,390 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:29,390 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-09-26 21:42:29,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:29,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:29,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:29,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:42:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:29,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:29,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:29,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:42:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:42:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:42:29,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:29,652 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-09-26 21:42:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:36,120 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-09-26 21:42:36,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:42:36,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:42:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:36,124 INFO L225 Difference]: With dead ends: 2110 [2018-09-26 21:42:36,124 INFO L226 Difference]: Without dead ends: 1097 [2018-09-26 21:42:36,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-26 21:42:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-09-26 21:42:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-26 21:42:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-09-26 21:42:36,338 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-09-26 21:42:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:36,338 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-09-26 21:42:36,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:42:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-09-26 21:42:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:36,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:36,339 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:36,339 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:36,339 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-09-26 21:42:36,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:36,516 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:36,516 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-09-26 21:42:36,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:36,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:36,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:36,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:42:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:42:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:42:36,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:36,619 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-09-26 21:42:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:44,127 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-09-26 21:42:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:42:44,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:42:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:44,133 INFO L225 Difference]: With dead ends: 2832 [2018-09-26 21:42:44,134 INFO L226 Difference]: Without dead ends: 1867 [2018-09-26 21:42:44,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-09-26 21:42:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-09-26 21:42:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-09-26 21:42:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-09-26 21:42:44,505 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-09-26 21:42:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:44,505 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-09-26 21:42:44,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:42:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-09-26 21:42:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:44,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:44,506 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:44,506 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:44,507 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-26 21:42:44,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:44,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:44,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:44,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:44,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:44,601 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:44,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 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-09-26 21:42:44,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:44,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:42:44,720 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:44,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-26 21:42:44,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:42:44,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:42:44,721 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:44,721 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-09-26 21:42:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:57,036 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-09-26 21:42:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:42:57,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:42:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:57,069 INFO L225 Difference]: With dead ends: 4461 [2018-09-26 21:42:57,069 INFO L226 Difference]: Without dead ends: 2887 [2018-09-26 21:42:57,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-09-26 21:42:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-09-26 21:42:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-09-26 21:42:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-09-26 21:42:58,149 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-09-26 21:42:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:58,149 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-09-26 21:42:58,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:42:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-09-26 21:42:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:58,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:58,151 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:42:58,151 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:58,151 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-26 21:42:58,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:58,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:58,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:58,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:58,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:58,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 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-09-26 21:42:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:58,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:42:58,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:58,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:42:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:42:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:42:58,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:58,550 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-09-26 21:43:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:12,941 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-09-26 21:43:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 21:43:12,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 21:43:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:12,948 INFO L225 Difference]: With dead ends: 3903 [2018-09-26 21:43:12,949 INFO L226 Difference]: Without dead ends: 3227 [2018-09-26 21:43:12,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-09-26 21:43:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-09-26 21:43:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-09-26 21:43:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-09-26 21:43:13,638 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-09-26 21:43:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:13,638 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-09-26 21:43:13,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:43:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-09-26 21:43:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:43:13,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:13,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:13,640 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:13,640 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-09-26 21:43:13,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:13,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:14,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:14,143 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-09-26 21:43:14,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:14,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:14,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:14,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-26 21:43:14,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:43:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:43:14,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:14,283 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-09-26 21:43:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:21,555 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-09-26 21:43:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:43:21,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:43:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:21,560 INFO L225 Difference]: With dead ends: 5427 [2018-09-26 21:43:21,560 INFO L226 Difference]: Without dead ends: 2851 [2018-09-26 21:43:21,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-09-26 21:43:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-09-26 21:43:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-09-26 21:43:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-09-26 21:43:22,320 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-09-26 21:43:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:22,320 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-09-26 21:43:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:43:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-09-26 21:43:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:43:22,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:22,321 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:43:22,321 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:22,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-09-26 21:43:22,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:22,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:22,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:22,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:22,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 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-09-26 21:43:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:22,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:43:22,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:22,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:43:22,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:43:22,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:43:22,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:22,544 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-09-26 21:43:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:30,558 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-09-26 21:43:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:43:30,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:43:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:30,565 INFO L225 Difference]: With dead ends: 5837 [2018-09-26 21:43:30,565 INFO L226 Difference]: Without dead ends: 3072 [2018-09-26 21:43:30,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-09-26 21:43:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-09-26 21:43:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-26 21:43:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-09-26 21:43:31,327 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-09-26 21:43:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:31,327 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-09-26 21:43:31,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:43:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-09-26 21:43:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:31,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:31,329 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:43:31,329 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:31,329 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-09-26 21:43:31,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:31,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:31,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:43:31,740 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:31,740 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-09-26 21:43:31,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:31,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:31,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:31,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-26 21:43:31,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:43:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:43:31,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:31,988 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-09-26 21:44:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:00,220 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-09-26 21:44:00,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 21:44:00,220 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-09-26 21:44:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:00,225 INFO L225 Difference]: With dead ends: 5120 [2018-09-26 21:44:00,225 INFO L226 Difference]: Without dead ends: 3342 [2018-09-26 21:44:00,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-09-26 21:44:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-09-26 21:44:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-09-26 21:44:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-09-26 21:44:01,065 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-09-26 21:44:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:01,065 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-09-26 21:44:01,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:44:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-09-26 21:44:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:44:01,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:01,067 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:01,067 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:01,067 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-09-26 21:44:01,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:01,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:01,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:01,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:01,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:44:01,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:01,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:44:01,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:01,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-26 21:44:01,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:44:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:44:01,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:01,473 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 18 states. [2018-09-26 21:44:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:11,609 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-09-26 21:44:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:44:11,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:44:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:11,614 INFO L225 Difference]: With dead ends: 3487 [2018-09-26 21:44:11,614 INFO L226 Difference]: Without dead ends: 3485 [2018-09-26 21:44:11,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-09-26 21:44:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-09-26 21:44:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-09-26 21:44:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-09-26 21:44:12,432 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-09-26 21:44:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:12,432 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-09-26 21:44:12,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:44:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-09-26 21:44:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:44:12,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:12,434 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:12,434 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:12,434 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-09-26 21:44:12,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:12,558 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:12,558 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-09-26 21:44:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:12,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:44:12,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:12,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-26 21:44:12,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:44:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:44:12,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:12,793 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 18 states. [2018-09-26 21:44:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:23,698 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-09-26 21:44:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:44:23,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:44:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:23,702 INFO L225 Difference]: With dead ends: 3557 [2018-09-26 21:44:23,702 INFO L226 Difference]: Without dead ends: 3555 [2018-09-26 21:44:23,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-09-26 21:44:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-09-26 21:44:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-09-26 21:44:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-09-26 21:44:24,557 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-09-26 21:44:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:24,558 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-09-26 21:44:24,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:44:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-09-26 21:44:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:44:24,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:24,560 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:24,560 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:24,560 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-09-26 21:44:24,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:24,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:24,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:24,680 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-09-26 21:44:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:44:24,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:44:24,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:44:24,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:24,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:24,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-26 21:44:24,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:44:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:44:24,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:24,913 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-09-26 21:45:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:45:02,528 INFO L93 Difference]: Finished difference Result 5268 states and 8851 transitions. [2018-09-26 21:45:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 21:45:02,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:45:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:45:02,533 INFO L225 Difference]: With dead ends: 5268 [2018-09-26 21:45:02,533 INFO L226 Difference]: Without dead ends: 5266 [2018-09-26 21:45:02,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:45:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-09-26 21:45:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 3515. [2018-09-26 21:45:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-09-26 21:45:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-09-26 21:45:03,388 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-09-26 21:45:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:45:03,388 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-09-26 21:45:03,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:45:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-09-26 21:45:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:45:03,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:45:03,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:45:03,389 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:45:03,389 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:45:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-09-26 21:45:03,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:45:03,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:45:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:45:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:45:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:45:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:03,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:45:03,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 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-09-26 21:45:03,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:45:03,579 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:45:03,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:45:03,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:45:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:45:03,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:45:03,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-26 21:45:03,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:45:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:45:03,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:45:03,804 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. Received shutdown request... [2018-09-26 21:45:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:45:06,063 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:45:06,068 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:45:06,069 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:45:06 BoogieIcfgContainer [2018-09-26 21:45:06,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:45:06,070 INFO L168 Benchmark]: Toolchain (without parser) took 253766.08 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 844.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -227.0 MB). Peak memory consumption was 617.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:45:06,072 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:45:06,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:45:06,073 INFO L168 Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:45:06,073 INFO L168 Benchmark]: RCFGBuilder took 380.83 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:45:06,074 INFO L168 Benchmark]: TraceAbstraction took 253313.22 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 844.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -248.2 MB). Peak memory consumption was 596.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:45:06,077 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.01 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 380.83 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253313.22 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 844.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -248.2 MB). Peak memory consumption was 596.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (3515states) and FLOYD_HOARE automaton (currently 18 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (3515states) and FLOYD_HOARE automaton (currently 18 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (3515states) and FLOYD_HOARE automaton (currently 18 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (3515states) and FLOYD_HOARE automaton (currently 18 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (58 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 253.1s OverallTime, 45 OverallIterations, 3 TraceHistogramMax, 229.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1570 SDtfs, 6090 SDslu, 3992 SDs, 0 SdLazy, 27528 SolverSat, 3788 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1796 GetRequests, 298 SyntacticMatches, 4 SemanticMatches, 1494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3515occurred in iteration=44, 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: 10.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 8932 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 900 ConstructedInterpolants, 75 QuantifiedInterpolants, 78812 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1500 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 82 InterpolantComputations, 9 PerfectInterpolantSequences, 84/402 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/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-45-06-090.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-45-06-090.csv Completed graceful shutdown