java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:14:17,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:14:17,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:14:17,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:14:17,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:14:17,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:14:17,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:14:17,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:14:17,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:14:17,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:14:17,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:14:17,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:14:17,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:14:17,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:14:17,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:14:17,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:14:17,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:14:17,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:14:17,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:14:17,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:14:17,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:14:17,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:14:17,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:14:17,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:14:17,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:14:17,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:14:17,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:14:17,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:14:17,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:14:17,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:14:17,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:14:17,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:14:17,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:14:17,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:14:17,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:14:17,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:14:17,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:14:17,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:14:17,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:14:17,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:14:17,091 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:14:17,092 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:14:17,092 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:14:17,092 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:14:17,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:14:17,092 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:14:17,093 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:14:17,094 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:14:17,094 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:14:17,094 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:14:17,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:14:17,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:14:17,095 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:14:17,095 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:14:17,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:17,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:14:17,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:14:17,096 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:14:17,096 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:14:17,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:14:17,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:14:17,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:14:17,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:14:17,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:14:17,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:14:17,168 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:14:17,169 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:14:17,171 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-10-04 12:14:17,171 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-04 12:14:17,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:14:17,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:14:17,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:17,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:14:17,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:14:17,261 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 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,273 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 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,278 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:14:17,278 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:14:17,278 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:14:17,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:17,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:14:17,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:14:17,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:14:17,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... [2018-10-04 12:14:17,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:14:17,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:14:17,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:14:17,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:14:17,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:17,359 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:14:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:14:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:14:17,936 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:14:17,937 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17 BoogieIcfgContainer [2018-10-04 12:14:17,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:14:17,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:14:17,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:14:17,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:14:17,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:17" (1/2) ... [2018-10-04 12:14:17,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9eb6b7 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:14:17, skipping insertion in model container [2018-10-04 12:14:17,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17" (2/2) ... [2018-10-04 12:14:17,954 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-04 12:14:17,966 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:14:17,978 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 12:14:18,039 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:14:18,040 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:14:18,040 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:14:18,041 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:14:18,041 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:14:18,041 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:14:18,041 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:14:18,041 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:14:18,042 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:14:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:14:18,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:14:18,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:14:18,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-04 12:14:18,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:18,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:18,416 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-04 12:14:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:18,886 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-04 12:14:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:18,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:14:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:18,903 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:14:18,904 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:14:18,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:14:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-04 12:14:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:14:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-04 12:14:18,950 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-04 12:14:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:18,951 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-04 12:14:18,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-04 12:14:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:14:18,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:14:18,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-04 12:14:18,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:19,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:19,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:19,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:19,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:19,021 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-04 12:14:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:19,368 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-04 12:14:19,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:19,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:14:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:19,370 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:14:19,371 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:14:19,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:14:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-04 12:14:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:14:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-04 12:14:19,380 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-04 12:14:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:19,381 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-04 12:14:19,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-04 12:14:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:19,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:19,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:19,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:19,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-04 12:14:19,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:19,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:19,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:19,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:14:19,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:14:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:14:19,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:19,475 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-04 12:14:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:20,177 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-04 12:14:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:14:20,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:14:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:20,179 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:14:20,179 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:14:20,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:14:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-04 12:14:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:14:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-04 12:14:20,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-04 12:14:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:20,191 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-04 12:14:20,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:14:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-04 12:14:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:20,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:20,192 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:20,192 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:20,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-04 12:14:20,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:20,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:14:20,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:14:20,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:14:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:20,258 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-04 12:14:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:20,623 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-04 12:14:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:14:20,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:14:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:20,625 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:14:20,625 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 12:14:20,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 12:14:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-04 12:14:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:14:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-04 12:14:20,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-04 12:14:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-04 12:14:20,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:14:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-04 12:14:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:20,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:20,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:20,647 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:20,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-04 12:14:20,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:20,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:20,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:21,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:21,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:21,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:21,196 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-04 12:14:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:22,502 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-04 12:14:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:14:22,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-04 12:14:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:22,505 INFO L225 Difference]: With dead ends: 107 [2018-10-04 12:14:22,505 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 12:14:22,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 12:14:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-04 12:14:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:14:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-04 12:14:22,522 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-04 12:14:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:22,522 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-04 12:14:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-04 12:14:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:22,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:22,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:22,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:22,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-04 12:14:22,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:22,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:22,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:22,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:22,665 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-04 12:14:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:23,032 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-04 12:14:23,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:23,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:23,036 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:14:23,036 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:14:23,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:14:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-04 12:14:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:14:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-04 12:14:23,054 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-04 12:14:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:23,054 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-04 12:14:23,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-04 12:14:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:23,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:23,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:23,057 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:23,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-04 12:14:23,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:23,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:23,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:23,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:23,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:23,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 12:14:23,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:23,352 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-04 12:14:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:25,058 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-04 12:14:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:25,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 12:14:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:25,062 INFO L225 Difference]: With dead ends: 150 [2018-10-04 12:14:25,062 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 12:14:25,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:14:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 12:14:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-04 12:14:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 12:14:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-04 12:14:25,112 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-04 12:14:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:25,112 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-04 12:14:25,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-04 12:14:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:25,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:25,118 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:25,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:25,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-04 12:14:25,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:25,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:25,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:25,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-04 12:14:25,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:25,490 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-04 12:14:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:26,638 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-04 12:14:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:14:26,642 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 12:14:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:26,643 INFO L225 Difference]: With dead ends: 137 [2018-10-04 12:14:26,644 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:14:26,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:14:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:14:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-04 12:14:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 12:14:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-04 12:14:26,670 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-04 12:14:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:26,671 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-04 12:14:26,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-04 12:14:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:26,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:26,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:26,672 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:26,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:26,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-04 12:14:26,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:26,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:27,064 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-10-04 12:14:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:27,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:27,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:27,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:27,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:27,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-10-04 12:14:27,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:27,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:27,323 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-10-04 12:14:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:29,333 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-04 12:14:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:29,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-10-04 12:14:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:29,335 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:14:29,335 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 12:14:29,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:14:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 12:14:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-04 12:14:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 12:14:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-04 12:14:29,368 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-04 12:14:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:29,368 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-04 12:14:29,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-04 12:14:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:29,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:29,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:29,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:29,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-04 12:14:29,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:29,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:29,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:29,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 12:14:29,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:29,544 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-10-04 12:14:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:30,486 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-04 12:14:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:30,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-04 12:14:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:30,489 INFO L225 Difference]: With dead ends: 246 [2018-10-04 12:14:30,489 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 12:14:30,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 12:14:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-04 12:14:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 12:14:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-04 12:14:30,526 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-04 12:14:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:30,526 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-04 12:14:30,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-04 12:14:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:30,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:30,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:30,528 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:30,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-04 12:14:30,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:30,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:30,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:30,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:30,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:30,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:30,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:30,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:14:30,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:30,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:30,707 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-04 12:14:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:31,158 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-04 12:14:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:14:31,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:31,161 INFO L225 Difference]: With dead ends: 252 [2018-10-04 12:14:31,161 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 12:14:31,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 12:14:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-04 12:14:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 12:14:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-04 12:14:31,197 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-04 12:14:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:31,197 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-04 12:14:31,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-04 12:14:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:31,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:31,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:31,198 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:31,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-04 12:14:31,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:31,295 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:31,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:31,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 12:14:31,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:31,361 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-04 12:14:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:31,773 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-04 12:14:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:14:31,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-04 12:14:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:31,776 INFO L225 Difference]: With dead ends: 260 [2018-10-04 12:14:31,776 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 12:14:31,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 12:14:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-04 12:14:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-04 12:14:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-04 12:14:31,814 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-04 12:14:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:31,814 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-04 12:14:31,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-04 12:14:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:31,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:31,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:31,816 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:31,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-04 12:14:31,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:31,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:31,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:31,901 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-04 12:14:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:32,474 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-04 12:14:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:32,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:32,476 INFO L225 Difference]: With dead ends: 316 [2018-10-04 12:14:32,477 INFO L226 Difference]: Without dead ends: 314 [2018-10-04 12:14:32,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-04 12:14:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-04 12:14:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 12:14:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-04 12:14:32,522 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-04 12:14:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:32,522 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-04 12:14:32,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-04 12:14:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:32,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:32,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:32,523 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:32,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-04 12:14:32,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:32,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:32,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:32,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:32,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:32,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:32,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:14:32,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:32,641 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-04 12:14:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:33,063 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-04 12:14:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:14:33,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:33,072 INFO L225 Difference]: With dead ends: 428 [2018-10-04 12:14:33,072 INFO L226 Difference]: Without dead ends: 426 [2018-10-04 12:14:33,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-04 12:14:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-04 12:14:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-04 12:14:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-04 12:14:33,134 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-04 12:14:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:33,134 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-04 12:14:33,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-04 12:14:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:33,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:33,135 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:33,135 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:33,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:33,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-04 12:14:33,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:33,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:33,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:33,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:33,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 12:14:33,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:33,381 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-04 12:14:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:34,647 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-04 12:14:34,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:34,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 12:14:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:34,651 INFO L225 Difference]: With dead ends: 466 [2018-10-04 12:14:34,651 INFO L226 Difference]: Without dead ends: 464 [2018-10-04 12:14:34,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-04 12:14:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-04 12:14:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 12:14:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-04 12:14:34,733 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-04 12:14:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:34,734 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-04 12:14:34,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-04 12:14:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:34,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:34,735 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:34,735 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-04 12:14:34,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:34,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:34,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:35,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:35,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-04 12:14:35,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:35,466 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-04 12:14:37,880 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-04 12:14:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:38,340 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-04 12:14:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:14:38,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-04 12:14:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:38,344 INFO L225 Difference]: With dead ends: 859 [2018-10-04 12:14:38,344 INFO L226 Difference]: Without dead ends: 509 [2018-10-04 12:14:38,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:14:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-04 12:14:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-04 12:14:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-04 12:14:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-04 12:14:38,431 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-04 12:14:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:38,432 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-04 12:14:38,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-04 12:14:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:38,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:38,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:38,433 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:38,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-04 12:14:38,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:38,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:38,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:38,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:38,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:38,587 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-04 12:14:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:39,146 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-04 12:14:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:14:39,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 12:14:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:39,148 INFO L225 Difference]: With dead ends: 481 [2018-10-04 12:14:39,148 INFO L226 Difference]: Without dead ends: 479 [2018-10-04 12:14:39,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:14:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-04 12:14:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-04 12:14:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 12:14:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-04 12:14:39,236 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-04 12:14:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:39,237 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-04 12:14:39,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-04 12:14:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:39,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:39,238 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:39,238 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:39,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-04 12:14:39,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:39,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:39,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:39,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:39,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:39,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:39,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 12:14:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:39,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:39,503 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-04 12:14:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:40,603 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-10-04 12:14:40,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:40,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 12:14:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:40,606 INFO L225 Difference]: With dead ends: 952 [2018-10-04 12:14:40,606 INFO L226 Difference]: Without dead ends: 559 [2018-10-04 12:14:40,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-04 12:14:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-10-04 12:14:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-04 12:14:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-10-04 12:14:40,693 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-10-04 12:14:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:40,693 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-10-04 12:14:40,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-10-04 12:14:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:40,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:40,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:40,695 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:40,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-10-04 12:14:40,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:40,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:40,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:40,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:14:40,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:40,830 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-10-04 12:14:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:41,352 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-10-04 12:14:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:41,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 12:14:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:41,355 INFO L225 Difference]: With dead ends: 524 [2018-10-04 12:14:41,355 INFO L226 Difference]: Without dead ends: 522 [2018-10-04 12:14:41,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:14:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-04 12:14:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-10-04 12:14:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-04 12:14:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-10-04 12:14:41,466 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-10-04 12:14:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:41,467 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-10-04 12:14:41,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-10-04 12:14:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:41,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:41,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:41,468 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:41,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-10-04 12:14:41,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:41,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:41,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:41,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:41,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:42,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-04 12:14:42,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:42,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:42,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:42,340 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-10-04 12:14:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:43,368 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-10-04 12:14:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:43,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-04 12:14:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:43,371 INFO L225 Difference]: With dead ends: 556 [2018-10-04 12:14:43,371 INFO L226 Difference]: Without dead ends: 554 [2018-10-04 12:14:43,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:14:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-04 12:14:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-10-04 12:14:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-04 12:14:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-10-04 12:14:43,464 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-10-04 12:14:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:43,464 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-10-04 12:14:43,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-10-04 12:14:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:43,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:43,465 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:43,466 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:43,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-10-04 12:14:43,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:43,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:43,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:43,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:43,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-10-04 12:14:43,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:43,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:43,679 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-10-04 12:14:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:44,693 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-10-04 12:14:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:44,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 12:14:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:44,696 INFO L225 Difference]: With dead ends: 631 [2018-10-04 12:14:44,696 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 12:14:44,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:14:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 12:14:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-10-04 12:14:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-04 12:14:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-10-04 12:14:44,812 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-10-04 12:14:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:44,813 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-10-04 12:14:44,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-10-04 12:14:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:44,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:44,814 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:44,814 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:44,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-10-04 12:14:44,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:44,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:44,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:14:44,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:14:44,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:44,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:14:44,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:44,990 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-10-04 12:14:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:45,490 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-10-04 12:14:45,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:45,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:14:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:45,493 INFO L225 Difference]: With dead ends: 601 [2018-10-04 12:14:45,494 INFO L226 Difference]: Without dead ends: 599 [2018-10-04 12:14:45,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-04 12:14:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-10-04 12:14:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-04 12:14:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-10-04 12:14:45,611 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-10-04 12:14:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:45,611 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-10-04 12:14:45,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-10-04 12:14:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:45,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:45,612 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:45,612 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:45,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-10-04 12:14:45,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:45,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:45,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:45,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:45,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:45,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:45,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:45,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:45,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:14:45,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:45,737 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-10-04 12:14:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:46,466 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-10-04 12:14:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:14:46,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:14:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:46,469 INFO L225 Difference]: With dead ends: 624 [2018-10-04 12:14:46,469 INFO L226 Difference]: Without dead ends: 622 [2018-10-04 12:14:46,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-04 12:14:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-10-04 12:14:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-10-04 12:14:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-10-04 12:14:46,567 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-10-04 12:14:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:46,567 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-10-04 12:14:46,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-10-04 12:14:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:46,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:46,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:46,568 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:46,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-10-04 12:14:46,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:46,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:46,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:14:46,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:46,704 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-10-04 12:14:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:47,104 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-10-04 12:14:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:14:47,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:14:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:47,106 INFO L225 Difference]: With dead ends: 584 [2018-10-04 12:14:47,106 INFO L226 Difference]: Without dead ends: 582 [2018-10-04 12:14:47,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-04 12:14:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-10-04 12:14:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-04 12:14:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-10-04 12:14:47,196 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-10-04 12:14:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-10-04 12:14:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-10-04 12:14:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:47,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:47,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:47,197 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:47,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-10-04 12:14:47,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:47,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:47,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:14:47,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:47,373 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-10-04 12:14:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:47,793 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-10-04 12:14:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:47,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:14:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:47,795 INFO L225 Difference]: With dead ends: 618 [2018-10-04 12:14:47,795 INFO L226 Difference]: Without dead ends: 616 [2018-10-04 12:14:47,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-04 12:14:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-10-04 12:14:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-04 12:14:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-10-04 12:14:47,891 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-10-04 12:14:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:47,892 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-10-04 12:14:47,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-10-04 12:14:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:47,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:47,893 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:47,893 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:47,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-10-04 12:14:47,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:47,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:47,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:47,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:14:47,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:48,000 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-10-04 12:14:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:48,416 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-10-04 12:14:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:48,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:14:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:48,419 INFO L225 Difference]: With dead ends: 613 [2018-10-04 12:14:48,419 INFO L226 Difference]: Without dead ends: 611 [2018-10-04 12:14:48,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-04 12:14:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-10-04 12:14:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-04 12:14:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-10-04 12:14:48,520 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-10-04 12:14:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:48,521 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-10-04 12:14:48,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-10-04 12:14:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:14:48,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:48,522 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:48,522 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:48,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-10-04 12:14:48,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:48,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:48,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:48,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:48,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:48,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:48,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 12:14:49,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:49,046 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 12 states. [2018-10-04 12:14:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:49,977 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-10-04 12:14:49,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:49,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 12:14:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:49,982 INFO L225 Difference]: With dead ends: 875 [2018-10-04 12:14:49,982 INFO L226 Difference]: Without dead ends: 873 [2018-10-04 12:14:49,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:14:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-10-04 12:14:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-10-04 12:14:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-04 12:14:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-10-04 12:14:50,117 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-10-04 12:14:50,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:50,117 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-10-04 12:14:50,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-10-04 12:14:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:14:50,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:50,118 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:50,118 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:50,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-10-04 12:14:50,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:50,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:50,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:50,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:50,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:50,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:50,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-10-04 12:14:50,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:50,301 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-10-04 12:14:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:51,822 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-10-04 12:14:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:14:51,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 12:14:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:51,827 INFO L225 Difference]: With dead ends: 1281 [2018-10-04 12:14:51,827 INFO L226 Difference]: Without dead ends: 1279 [2018-10-04 12:14:51,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:14:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-04 12:14:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-10-04 12:14:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-04 12:14:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-04 12:14:52,008 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-10-04 12:14:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:52,008 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-04 12:14:52,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-04 12:14:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:52,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:52,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:52,010 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:52,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-10-04 12:14:52,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:52,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:52,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:52,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:52,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:52,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:14:52,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:14:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:14:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:52,166 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-10-04 12:14:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:52,901 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-10-04 12:14:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:14:52,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-04 12:14:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:52,905 INFO L225 Difference]: With dead ends: 1054 [2018-10-04 12:14:52,905 INFO L226 Difference]: Without dead ends: 1052 [2018-10-04 12:14:52,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:14:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-04 12:14:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-10-04 12:14:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 12:14:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-10-04 12:14:53,074 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-10-04 12:14:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:53,074 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-10-04 12:14:53,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:14:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-10-04 12:14:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:53,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:53,076 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:53,076 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:53,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-10-04 12:14:53,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:53,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:53,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:14:53,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:14:53,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:14:53,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-04 12:14:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:53,256 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 12 states. [2018-10-04 12:14:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:54,406 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-10-04 12:14:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:54,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-04 12:14:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:54,411 INFO L225 Difference]: With dead ends: 1125 [2018-10-04 12:14:54,411 INFO L226 Difference]: Without dead ends: 1123 [2018-10-04 12:14:54,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:14:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-04 12:14:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-10-04 12:14:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-04 12:14:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-04 12:14:54,587 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-10-04 12:14:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:54,587 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-04 12:14:54,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-04 12:14:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:54,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:54,588 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:54,589 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:54,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-10-04 12:14:54,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:54,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:54,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:54,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:54,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-04 12:14:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:54,818 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-10-04 12:14:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:56,213 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-10-04 12:14:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:14:56,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:14:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:56,218 INFO L225 Difference]: With dead ends: 1125 [2018-10-04 12:14:56,218 INFO L226 Difference]: Without dead ends: 1123 [2018-10-04 12:14:56,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:14:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-04 12:14:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-10-04 12:14:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-04 12:14:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-10-04 12:14:56,401 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-10-04 12:14:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:56,401 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-10-04 12:14:56,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-10-04 12:14:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:56,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:56,402 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:56,402 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:56,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-10-04 12:14:56,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:56,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:56,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:56,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:56,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:56,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:56,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:56,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:56,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-04 12:14:56,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:56,576 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-10-04 12:14:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:57,403 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-10-04 12:14:57,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:14:57,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-04 12:14:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:57,407 INFO L225 Difference]: With dead ends: 1117 [2018-10-04 12:14:57,407 INFO L226 Difference]: Without dead ends: 1115 [2018-10-04 12:14:57,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:14:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-10-04 12:14:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-10-04 12:14:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-04 12:14:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-10-04 12:14:57,572 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-10-04 12:14:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:57,572 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-10-04 12:14:57,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-10-04 12:14:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:57,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:57,573 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:57,574 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:57,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-10-04 12:14:57,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:57,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:57,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:57,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:57,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:57,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:57,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:57,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:14:57,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:14:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:14:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:57,781 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-10-04 12:14:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:58,572 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-10-04 12:14:58,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:58,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-04 12:14:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:58,577 INFO L225 Difference]: With dead ends: 995 [2018-10-04 12:14:58,577 INFO L226 Difference]: Without dead ends: 993 [2018-10-04 12:14:58,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:14:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-04 12:14:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-10-04 12:14:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-10-04 12:14:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-10-04 12:14:58,762 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-10-04 12:14:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:58,762 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-10-04 12:14:58,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:14:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-10-04 12:14:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:14:58,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:58,763 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:14:58,763 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:58,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-10-04 12:14:58,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:58,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:58,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:58,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:58,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:59,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:59,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 12:14:59,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:14:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:14:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:59,114 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-10-04 12:15:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:01,520 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-10-04 12:15:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:15:01,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-04 12:15:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:01,524 INFO L225 Difference]: With dead ends: 2105 [2018-10-04 12:15:01,524 INFO L226 Difference]: Without dead ends: 1229 [2018-10-04 12:15:01,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=635, Invalid=2557, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:15:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-04 12:15:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-10-04 12:15:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-04 12:15:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-10-04 12:15:01,741 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-10-04 12:15:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:01,741 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-10-04 12:15:01,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:15:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-10-04 12:15:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:01,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:01,742 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:01,743 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:01,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-10-04 12:15:01,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:01,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:01,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:01,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:01,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:01,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:01,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:15:01,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:01,980 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-10-04 12:15:02,743 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-10-04 12:15:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:03,993 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-10-04 12:15:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:15:03,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:03,997 INFO L225 Difference]: With dead ends: 2110 [2018-10-04 12:15:03,997 INFO L226 Difference]: Without dead ends: 1097 [2018-10-04 12:15:03,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=426, Invalid=2024, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:15:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-04 12:15:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-10-04 12:15:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-04 12:15:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-10-04 12:15:04,187 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-10-04 12:15:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:04,187 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-10-04 12:15:04,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-10-04 12:15:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:04,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:04,188 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:04,188 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:04,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-10-04 12:15:04,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:04,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:04,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:04,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:04,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:04,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:04,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:04,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:15:04,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:04,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:04,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:04,797 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-10-04 12:15:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:07,191 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-10-04 12:15:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:15:07,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:07,198 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 12:15:07,198 INFO L226 Difference]: Without dead ends: 1867 [2018-10-04 12:15:07,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=702, Invalid=3330, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:15:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-10-04 12:15:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-10-04 12:15:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-04 12:15:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-10-04 12:15:07,569 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-10-04 12:15:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:07,569 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-10-04 12:15:07,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-10-04 12:15:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:07,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:07,570 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:07,570 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:07,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-10-04 12:15:07,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:07,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:07,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:07,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:07,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:07,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:15:07,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:07,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:07,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:07,788 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-10-04 12:15:11,125 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-04 12:15:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:12,011 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-10-04 12:15:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:15:12,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:12,032 INFO L225 Difference]: With dead ends: 4461 [2018-10-04 12:15:12,033 INFO L226 Difference]: Without dead ends: 2887 [2018-10-04 12:15:12,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1321, Invalid=5159, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:15:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-04 12:15:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-10-04 12:15:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-10-04 12:15:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-10-04 12:15:12,979 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-10-04 12:15:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:12,980 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-10-04 12:15:12,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-10-04 12:15:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:12,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:12,981 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:15:12,984 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:12,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:12,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-10-04 12:15:12,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:13,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:13,932 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:13,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:13,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:14,515 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-04 12:15:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:15,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:15,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 12:15:15,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:15,701 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-10-04 12:15:16,322 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-04 12:15:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:20,198 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-10-04 12:15:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:15:20,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 12:15:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:20,205 INFO L225 Difference]: With dead ends: 3903 [2018-10-04 12:15:20,205 INFO L226 Difference]: Without dead ends: 3227 [2018-10-04 12:15:20,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1137, Invalid=6873, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:15:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-10-04 12:15:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-10-04 12:15:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-10-04 12:15:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-10-04 12:15:20,842 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-10-04 12:15:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:20,842 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-10-04 12:15:20,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-10-04 12:15:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:20,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:20,844 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:20,844 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:20,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-10-04 12:15:20,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:20,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:20,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:20,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:21,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:21,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:21,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:21,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:22,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:22,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:22,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:22,054 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-10-04 12:15:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:24,783 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-10-04 12:15:24,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:15:24,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:24,791 INFO L225 Difference]: With dead ends: 5427 [2018-10-04 12:15:24,791 INFO L226 Difference]: Without dead ends: 2851 [2018-10-04 12:15:24,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:15:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-10-04 12:15:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-10-04 12:15:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-10-04 12:15:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-10-04 12:15:25,417 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-10-04 12:15:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:25,418 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-10-04 12:15:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-10-04 12:15:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:25,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:25,419 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:15:25,419 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:25,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-10-04 12:15:25,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:25,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:25,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:25,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:25,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:15:25,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:25,616 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-10-04 12:15:28,270 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-10-04 12:15:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:28,838 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-10-04 12:15:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:15:28,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:28,845 INFO L225 Difference]: With dead ends: 5837 [2018-10-04 12:15:28,845 INFO L226 Difference]: Without dead ends: 3072 [2018-10-04 12:15:28,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=785, Invalid=3247, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:15:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-04 12:15:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-10-04 12:15:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-10-04 12:15:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-10-04 12:15:29,520 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-10-04 12:15:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:29,520 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-10-04 12:15:29,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-10-04 12:15:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:29,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:29,522 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:15:29,522 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:29,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:29,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-10-04 12:15:29,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:29,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:29,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:29,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:29,638 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:29,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:29,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:29,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:29,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 12:15:29,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:15:29,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:15:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:15:29,908 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-10-04 12:15:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:35,826 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-10-04 12:15:35,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 12:15:35,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-10-04 12:15:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:35,834 INFO L225 Difference]: With dead ends: 5120 [2018-10-04 12:15:35,834 INFO L226 Difference]: Without dead ends: 3342 [2018-10-04 12:15:35,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3994 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1800, Invalid=9972, Unknown=0, NotChecked=0, Total=11772 [2018-10-04 12:15:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-10-04 12:15:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-10-04 12:15:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-10-04 12:15:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-10-04 12:15:36,658 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-10-04 12:15:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:36,658 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-10-04 12:15:36,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:15:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-10-04 12:15:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:36,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:36,660 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:36,660 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:36,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-10-04 12:15:36,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:36,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:36,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:36,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:36,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:36,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:15:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-10-04 12:15:36,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:36,945 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 16 states. [2018-10-04 12:15:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:40,093 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-10-04 12:15:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:15:40,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:15:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:40,100 INFO L225 Difference]: With dead ends: 3487 [2018-10-04 12:15:40,100 INFO L226 Difference]: Without dead ends: 3485 [2018-10-04 12:15:40,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:15:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-10-04 12:15:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-10-04 12:15:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-04 12:15:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-10-04 12:15:40,865 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-10-04 12:15:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:40,866 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-10-04 12:15:40,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-10-04 12:15:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:40,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:40,867 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:40,867 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:40,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-10-04 12:15:40,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:40,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:40,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:40,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:40,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:40,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:40,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:41,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:15:41,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:41,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-04 12:15:41,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:41,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:41,096 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 15 states. [2018-10-04 12:15:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:44,349 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-10-04 12:15:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:15:44,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-04 12:15:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:44,355 INFO L225 Difference]: With dead ends: 3557 [2018-10-04 12:15:44,355 INFO L226 Difference]: Without dead ends: 3555 [2018-10-04 12:15:44,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=674, Invalid=3486, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:15:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-10-04 12:15:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-10-04 12:15:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-10-04 12:15:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-10-04 12:15:45,161 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-10-04 12:15:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:45,162 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-10-04 12:15:45,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-10-04 12:15:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:45,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:45,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:45,163 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:45,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-10-04 12:15:45,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:45,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:45,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:45,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:45,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:45,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:45,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 12:15:45,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:15:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:15:45,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:45,433 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-10-04 12:15:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:53,664 INFO L93 Difference]: Finished difference Result 5252 states and 8823 transitions. [2018-10-04 12:15:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-04 12:15:53,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:15:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:53,669 INFO L225 Difference]: With dead ends: 5252 [2018-10-04 12:15:53,670 INFO L226 Difference]: Without dead ends: 5250 [2018-10-04 12:15:53,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7869 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2825, Invalid=16915, Unknown=0, NotChecked=0, Total=19740 [2018-10-04 12:15:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2018-10-04 12:15:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 3515. [2018-10-04 12:15:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-04 12:15:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-10-04 12:15:54,466 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-10-04 12:15:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:54,466 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-10-04 12:15:54,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:15:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-10-04 12:15:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:54,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:54,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:54,468 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:54,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-10-04 12:15:54,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:54,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:54,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:54,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:54,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:54,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:54,679 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:54,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:54,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:54,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:54,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-04 12:15:54,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:15:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:15:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:54,831 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-10-04 12:16:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:02,774 INFO L93 Difference]: Finished difference Result 4843 states and 8107 transitions. [2018-10-04 12:16:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-04 12:16:02,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:16:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:02,779 INFO L225 Difference]: With dead ends: 4843 [2018-10-04 12:16:02,779 INFO L226 Difference]: Without dead ends: 4841 [2018-10-04 12:16:02,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6131 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2645, Invalid=12855, Unknown=0, NotChecked=0, Total=15500 [2018-10-04 12:16:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2018-10-04 12:16:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3405. [2018-10-04 12:16:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-04 12:16:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-10-04 12:16:03,622 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-10-04 12:16:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:03,623 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-10-04 12:16:03,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-10-04 12:16:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:03,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:03,624 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:03,624 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-10-04 12:16:03,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:03,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:03,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:03,724 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:03,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:03,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:03,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:03,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:16:03,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:03,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 12:16:03,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:16:03,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:16:03,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:16:03,828 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-10-04 12:16:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:06,526 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-10-04 12:16:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:16:06,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:16:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:06,530 INFO L225 Difference]: With dead ends: 5774 [2018-10-04 12:16:06,530 INFO L226 Difference]: Without dead ends: 3100 [2018-10-04 12:16:06,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=2385, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:16:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-04 12:16:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-10-04 12:16:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-10-04 12:16:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-10-04 12:16:07,635 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-10-04 12:16:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:07,636 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-10-04 12:16:07,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:16:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-10-04 12:16:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:07,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:07,638 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:07,638 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:07,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:07,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-10-04 12:16:07,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:07,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:08,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:08,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:08,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:08,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-04 12:16:10,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:16:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:16:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:16:10,158 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 15 states. [2018-10-04 12:16:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:12,811 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-10-04 12:16:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:16:12,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-04 12:16:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:12,815 INFO L225 Difference]: With dead ends: 3114 [2018-10-04 12:16:12,815 INFO L226 Difference]: Without dead ends: 3112 [2018-10-04 12:16:12,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=409, Invalid=1847, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:16:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-10-04 12:16:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-10-04 12:16:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-10-04 12:16:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-10-04 12:16:13,556 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-10-04 12:16:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:13,556 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-10-04 12:16:13,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:16:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-10-04 12:16:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:13,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:13,558 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:13,558 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:13,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-10-04 12:16:13,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:13,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:13,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:13,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:13,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:13,950 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:13,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:13,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:14,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:14,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-04 12:16:14,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:16:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:16:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:16:14,064 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-10-04 12:16:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:19,372 INFO L93 Difference]: Finished difference Result 4415 states and 7404 transitions. [2018-10-04 12:16:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 12:16:19,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 12:16:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:19,377 INFO L225 Difference]: With dead ends: 4415 [2018-10-04 12:16:19,377 INFO L226 Difference]: Without dead ends: 4413 [2018-10-04 12:16:19,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1803, Invalid=6939, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:16:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-10-04 12:16:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3073. [2018-10-04 12:16:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-10-04 12:16:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-10-04 12:16:20,281 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-10-04 12:16:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:20,281 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-10-04 12:16:20,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:16:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-10-04 12:16:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:20,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:20,282 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:20,283 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:20,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-10-04 12:16:20,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:20,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:20,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:20,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:20,403 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:20,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:20,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:20,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:20,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-10-04 12:16:20,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:16:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:16:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:16:20,527 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 16 states. [2018-10-04 12:16:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:24,661 INFO L93 Difference]: Finished difference Result 4429 states and 7411 transitions. [2018-10-04 12:16:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:16:24,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:16:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:24,665 INFO L225 Difference]: With dead ends: 4429 [2018-10-04 12:16:24,666 INFO L226 Difference]: Without dead ends: 4427 [2018-10-04 12:16:24,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=906, Invalid=3384, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:16:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2018-10-04 12:16:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 2723. [2018-10-04 12:16:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-04 12:16:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-10-04 12:16:25,516 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-10-04 12:16:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:25,516 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-10-04 12:16:25,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:16:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-10-04 12:16:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:25,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:25,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:25,518 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:25,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:25,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-10-04 12:16:25,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:25,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:25,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:25,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:25,617 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:25,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:25,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 12:16:25,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:25,808 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 18 states. [2018-10-04 12:16:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:30,499 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-10-04 12:16:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:16:30,499 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:16:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:30,503 INFO L225 Difference]: With dead ends: 4290 [2018-10-04 12:16:30,504 INFO L226 Difference]: Without dead ends: 4288 [2018-10-04 12:16:30,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=986, Invalid=4416, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:16:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-10-04 12:16:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-10-04 12:16:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-10-04 12:16:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-10-04 12:16:31,554 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-10-04 12:16:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:31,555 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-10-04 12:16:31,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-10-04 12:16:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:31,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:31,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:31,556 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:31,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-10-04 12:16:31,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:31,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:31,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:31,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:31,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:16:31,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:16:31,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:31,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:31,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:31,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 12:16:31,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:31,903 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 18 states. [2018-10-04 12:16:37,358 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-04 12:16:40,326 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 12:16:43,118 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-10-04 12:16:43,326 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-04 12:16:43,912 WARN L178 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:16:44,379 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:16:46,278 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-10-04 12:16:47,460 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-10-04 12:16:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:53,747 INFO L93 Difference]: Finished difference Result 9624 states and 16323 transitions. [2018-10-04 12:16:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-04 12:16:53,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:16:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:53,757 INFO L225 Difference]: With dead ends: 9624 [2018-10-04 12:16:53,758 INFO L226 Difference]: Without dead ends: 9622 [2018-10-04 12:16:53,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16036 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=6166, Invalid=32839, Unknown=1, NotChecked=0, Total=39006 [2018-10-04 12:16:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2018-10-04 12:16:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 3326. [2018-10-04 12:16:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-10-04 12:16:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 5536 transitions. [2018-10-04 12:16:54,807 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 5536 transitions. Word has length 18 [2018-10-04 12:16:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:54,807 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 5536 transitions. [2018-10-04 12:16:54,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 5536 transitions. [2018-10-04 12:16:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:16:54,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:54,809 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:54,809 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:54,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-10-04 12:16:54,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:54,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:54,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:54,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:54,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:54,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:54,913 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:54,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-10-04 12:16:55,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:16:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:16:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:16:55,030 INFO L87 Difference]: Start difference. First operand 3326 states and 5536 transitions. Second operand 17 states. [2018-10-04 12:17:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:00,804 INFO L93 Difference]: Finished difference Result 5572 states and 9460 transitions. [2018-10-04 12:17:00,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 12:17:00,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 12:17:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:00,810 INFO L225 Difference]: With dead ends: 5572 [2018-10-04 12:17:00,810 INFO L226 Difference]: Without dead ends: 5570 [2018-10-04 12:17:00,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1511, Invalid=7045, Unknown=0, NotChecked=0, Total=8556 [2018-10-04 12:17:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2018-10-04 12:17:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3526. [2018-10-04 12:17:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-10-04 12:17:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5899 transitions. [2018-10-04 12:17:02,181 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5899 transitions. Word has length 18 [2018-10-04 12:17:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:02,181 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5899 transitions. [2018-10-04 12:17:02,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:17:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5899 transitions. [2018-10-04 12:17:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:17:02,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:02,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:02,183 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:02,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-10-04 12:17:02,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:02,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:02,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:02,338 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:17:02,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:17:02,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:02,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:02,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:02,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-10-04 12:17:02,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:17:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:17:02,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:17:02,459 INFO L87 Difference]: Start difference. First operand 3526 states and 5899 transitions. Second operand 17 states. [2018-10-04 12:17:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:06,854 INFO L93 Difference]: Finished difference Result 4458 states and 7480 transitions. [2018-10-04 12:17:06,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:17:06,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 12:17:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:06,860 INFO L225 Difference]: With dead ends: 4458 [2018-10-04 12:17:06,860 INFO L226 Difference]: Without dead ends: 4456 [2018-10-04 12:17:06,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=904, Invalid=5258, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:17:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-10-04 12:17:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3633. [2018-10-04 12:17:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2018-10-04 12:17:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6081 transitions. [2018-10-04 12:17:08,180 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6081 transitions. Word has length 18 [2018-10-04 12:17:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 3633 states and 6081 transitions. [2018-10-04 12:17:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:17:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6081 transitions. [2018-10-04 12:17:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:17:08,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:08,181 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:08,182 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:08,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:08,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-10-04 12:17:08,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:08,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:08,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:08,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:08,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:08,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:08,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:08,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:08,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-04 12:17:08,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:17:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:17:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:17:08,856 INFO L87 Difference]: Start difference. First operand 3633 states and 6081 transitions. Second operand 21 states. [2018-10-04 12:17:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:13,371 INFO L93 Difference]: Finished difference Result 4389 states and 7355 transitions. [2018-10-04 12:17:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:17:13,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-10-04 12:17:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:13,375 INFO L225 Difference]: With dead ends: 4389 [2018-10-04 12:17:13,375 INFO L226 Difference]: Without dead ends: 4376 [2018-10-04 12:17:13,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:17:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-10-04 12:17:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4152. [2018-10-04 12:17:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2018-10-04 12:17:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6931 transitions. [2018-10-04 12:17:14,947 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6931 transitions. Word has length 19 [2018-10-04 12:17:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:14,947 INFO L480 AbstractCegarLoop]: Abstraction has 4152 states and 6931 transitions. [2018-10-04 12:17:14,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:17:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6931 transitions. [2018-10-04 12:17:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:17:14,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:14,948 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:14,949 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:14,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:14,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-10-04 12:17:14,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:14,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:14,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:14,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:15,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:15,075 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:15,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:15,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:15,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:15,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-10-04 12:17:15,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:17:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:17:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:17:15,240 INFO L87 Difference]: Start difference. First operand 4152 states and 6931 transitions. Second operand 19 states. [2018-10-04 12:17:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:22,845 INFO L93 Difference]: Finished difference Result 7602 states and 12857 transitions. [2018-10-04 12:17:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:17:22,845 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-10-04 12:17:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:22,853 INFO L225 Difference]: With dead ends: 7602 [2018-10-04 12:17:22,853 INFO L226 Difference]: Without dead ends: 7553 [2018-10-04 12:17:22,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1106, Invalid=4006, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:17:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2018-10-04 12:17:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5765. [2018-10-04 12:17:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2018-10-04 12:17:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9725 transitions. [2018-10-04 12:17:25,427 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 9725 transitions. Word has length 19 [2018-10-04 12:17:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:25,427 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 9725 transitions. [2018-10-04 12:17:25,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:17:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 9725 transitions. [2018-10-04 12:17:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:17:25,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:25,429 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:25,429 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:25,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-10-04 12:17:25,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:25,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:25,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:25,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-10-04 12:17:25,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:17:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:17:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:17:25,695 INFO L87 Difference]: Start difference. First operand 5765 states and 9725 transitions. Second operand 18 states. [2018-10-04 12:17:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:36,831 INFO L93 Difference]: Finished difference Result 10730 states and 18220 transitions. [2018-10-04 12:17:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:17:36,832 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-10-04 12:17:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:36,841 INFO L225 Difference]: With dead ends: 10730 [2018-10-04 12:17:36,841 INFO L226 Difference]: Without dead ends: 10673 [2018-10-04 12:17:36,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1268, Invalid=5872, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:17:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2018-10-04 12:17:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 5867. [2018-10-04 12:17:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5867 states. [2018-10-04 12:17:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 9873 transitions. [2018-10-04 12:17:39,543 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 9873 transitions. Word has length 19 [2018-10-04 12:17:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:39,544 INFO L480 AbstractCegarLoop]: Abstraction has 5867 states and 9873 transitions. [2018-10-04 12:17:39,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:17:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 9873 transitions. [2018-10-04 12:17:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:17:39,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:39,545 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:17:39,546 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:39,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash -298147634, now seen corresponding path program 2 times [2018-10-04 12:17:39,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:39,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:39,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:39,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:39,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:17:39,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:17:39,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:39,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:17:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-04 12:17:39,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:17:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:17:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:17:39,854 INFO L87 Difference]: Start difference. First operand 5867 states and 9873 transitions. Second operand 20 states. [2018-10-04 12:17:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:45,270 INFO L93 Difference]: Finished difference Result 12951 states and 21640 transitions. [2018-10-04 12:17:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:17:45,271 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 12:17:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:45,276 INFO L225 Difference]: With dead ends: 12951 [2018-10-04 12:17:45,277 INFO L226 Difference]: Without dead ends: 7453 [2018-10-04 12:17:45,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:17:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2018-10-04 12:17:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 6977. [2018-10-04 12:17:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-10-04 12:17:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 11514 transitions. [2018-10-04 12:17:48,720 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 11514 transitions. Word has length 21 [2018-10-04 12:17:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:48,720 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 11514 transitions. [2018-10-04 12:17:48,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:17:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 11514 transitions. [2018-10-04 12:17:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:17:48,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:48,722 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:48,722 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:48,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 1 times [2018-10-04 12:17:48,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:48,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:48,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:48,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:48,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:48,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-10-04 12:17:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:17:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:17:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:17:48,943 INFO L87 Difference]: Start difference. First operand 6977 states and 11514 transitions. Second operand 17 states. [2018-10-04 12:17:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:54,411 INFO L93 Difference]: Finished difference Result 7309 states and 12055 transitions. [2018-10-04 12:17:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:17:54,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-04 12:17:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:54,419 INFO L225 Difference]: With dead ends: 7309 [2018-10-04 12:17:54,419 INFO L226 Difference]: Without dead ends: 7307 [2018-10-04 12:17:54,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:17:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-10-04 12:17:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 6935. [2018-10-04 12:17:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6935 states. [2018-10-04 12:17:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 11445 transitions. [2018-10-04 12:17:57,769 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 11445 transitions. Word has length 21 [2018-10-04 12:17:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:57,769 INFO L480 AbstractCegarLoop]: Abstraction has 6935 states and 11445 transitions. [2018-10-04 12:17:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:17:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 11445 transitions. [2018-10-04 12:17:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:17:57,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:57,771 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:57,771 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:57,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1010297104, now seen corresponding path program 1 times [2018-10-04 12:17:57,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:57,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:57,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:57,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:57,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:57,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:57,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:57,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:17:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-04 12:17:59,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:17:59,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:17:59,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:17:59,192 INFO L87 Difference]: Start difference. First operand 6935 states and 11445 transitions. Second operand 21 states. [2018-10-04 12:18:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:05,627 INFO L93 Difference]: Finished difference Result 11330 states and 18599 transitions. [2018-10-04 12:18:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:18:05,627 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-04 12:18:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:05,634 INFO L225 Difference]: With dead ends: 11330 [2018-10-04 12:18:05,635 INFO L226 Difference]: Without dead ends: 7599 [2018-10-04 12:18:05,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=590, Invalid=3442, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:18:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-04 12:18:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 6837. [2018-10-04 12:18:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-10-04 12:18:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 11276 transitions. [2018-10-04 12:18:08,918 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 11276 transitions. Word has length 21 [2018-10-04 12:18:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:08,919 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 11276 transitions. [2018-10-04 12:18:08,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:18:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 11276 transitions. [2018-10-04 12:18:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:18:08,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:08,921 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:08,921 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:08,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash -972124902, now seen corresponding path program 1 times [2018-10-04 12:18:08,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:09,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:09,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:09,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:09,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:18:09,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:09,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-10-04 12:18:09,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:18:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:18:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:18:09,366 INFO L87 Difference]: Start difference. First operand 6837 states and 11276 transitions. Second operand 15 states. [2018-10-04 12:18:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:14,180 INFO L93 Difference]: Finished difference Result 7136 states and 11762 transitions. [2018-10-04 12:18:14,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:18:14,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-04 12:18:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:14,187 INFO L225 Difference]: With dead ends: 7136 [2018-10-04 12:18:14,187 INFO L226 Difference]: Without dead ends: 7134 [2018-10-04 12:18:14,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:18:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2018-10-04 12:18:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 6814. [2018-10-04 12:18:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2018-10-04 12:18:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 11236 transitions. [2018-10-04 12:18:17,468 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 11236 transitions. Word has length 21 [2018-10-04 12:18:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:17,468 INFO L480 AbstractCegarLoop]: Abstraction has 6814 states and 11236 transitions. [2018-10-04 12:18:17,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:18:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 11236 transitions. [2018-10-04 12:18:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:18:17,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:17,470 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:18:17,470 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:17,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 4 times [2018-10-04 12:18:17,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:17,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:17,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:17,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:17,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:17,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:18:17,623 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:18:17,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:17,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:18:17,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 12:18:17,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:18:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:18:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:18:17,798 INFO L87 Difference]: Start difference. First operand 6814 states and 11236 transitions. Second operand 20 states. [2018-10-04 12:18:19,536 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 28 Received shutdown request... [2018-10-04 12:18:26,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 12:18:26,460 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:18:26,465 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:18:26,465 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:26 BoogieIcfgContainer [2018-10-04 12:18:26,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:26,466 INFO L168 Benchmark]: Toolchain (without parser) took 249232.08 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 85.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:26,467 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:26,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:26,468 INFO L168 Benchmark]: Boogie Preprocessor took 21.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:26,468 INFO L168 Benchmark]: RCFGBuilder took 634.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:26,469 INFO L168 Benchmark]: TraceAbstraction took 248527.25 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 64.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:26,471 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 634.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248527.25 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 64.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 123 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 123 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 123 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 123 states, 20 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 131 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 248.4s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 185.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2151 SDtfs, 10725 SDslu, 7099 SDs, 0 SdLazy, 56516 SolverSat, 7360 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 57.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3331 GetRequests, 511 SyntacticMatches, 21 SemanticMatches, 2798 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 75182 ImplicationChecksByTransitivity, 81.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6977occurred in iteration=57, 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: 38.9s AutomataMinimizationTime, 60 MinimizatonAttempts, 33087 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1480 ConstructedInterpolants, 87 QuantifiedInterpolants, 145148 SizeOfPredicates, 236 NumberOfNonLiveVariables, 2412 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 114 InterpolantComputations, 9 PerfectInterpolantSequences, 200/918 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-26-481.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-26-481.csv Completed graceful shutdown