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-d19836b [2018-09-26 21:12:34,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:12:34,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:12:34,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:12:34,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:12:34,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:12:34,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:12:34,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:12:34,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:12:34,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:12:34,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:12:34,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:12:34,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:12:34,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:12:34,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:12:34,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:12:34,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:12:34,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:12:34,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:12:34,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:12:34,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:12:34,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:12:34,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:12:34,163 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:12:34,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:12:34,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:12:34,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:12:34,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:12:34,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:12:34,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:12:34,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:12:34,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:12:34,169 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:12:34,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:12:34,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:12:34,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:12:34,171 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-09-26 21:12:34,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:12:34,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:12:34,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:12:34,188 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:12:34,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:12:34,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:12:34,189 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:12:34,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:12:34,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:12:34,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:12:34,190 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:12:34,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:12:34,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:12:34,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:12:34,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:12:34,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:12:34,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:12:34,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:12:34,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:12:34,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:12:34,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:12:34,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:12:34,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:34,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:12:34,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:12:34,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:12:34,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:12:34,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:12:34,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:12:34,193 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:12:34,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:12:34,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:12:34,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:12:34,253 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:12:34,253 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:12:34,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-26 21:12:34,254 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-26 21:12:34,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:12:34,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:12:34,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:34,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:12:34,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:12:34,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,362 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:12:34,362 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:12:34,362 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:12:34,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:34,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:12:34,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:12:34,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:12:34,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... [2018-09-26 21:12:34,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:12:34,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:12:34,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:12:34,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:12:34,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:34,445 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:12:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:12:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:12:34,809 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:12:34,809 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:34 BoogieIcfgContainer [2018-09-26 21:12:34,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:12:34,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:12:34,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:12:34,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:12:34,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:34" (1/2) ... [2018-09-26 21:12:34,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404519aa and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:12:34, skipping insertion in model container [2018-09-26 21:12:34,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:34" (2/2) ... [2018-09-26 21:12:34,820 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-26 21:12:34,830 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:12:34,839 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 21:12:34,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:12:34,893 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:12:34,893 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:12:34,893 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:12:34,893 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:12:34,894 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:12:34,894 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:12:34,894 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:12:34,894 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:12:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-26 21:12:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:12:34,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:34,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:12:34,933 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:34,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-26 21:12:34,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:34,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:35,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-09-26 21:12:35,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:35,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:12:35,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:12:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:12:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:12:35,421 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-26 21:12:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:35,944 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-26 21:12:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:12:35,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 21:12:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:35,960 INFO L225 Difference]: With dead ends: 32 [2018-09-26 21:12:35,960 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:12:35,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:12:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-26 21:12:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 21:12:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-26 21:12:36,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-26 21:12:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:36,008 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-26 21:12:36,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:12:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-26 21:12:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:12:36,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:36,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:12:36,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:36,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-26 21:12:36,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:36,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:36,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:36,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:12:36,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:12:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:12:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:12:36,111 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-26 21:12:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:36,427 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-26 21:12:36,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:12:36,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 21:12:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:36,429 INFO L225 Difference]: With dead ends: 38 [2018-09-26 21:12:36,429 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 21:12:36,430 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-09-26 21:12:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 21:12:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-26 21:12:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:12:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-26 21:12:36,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-26 21:12:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:36,439 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-26 21:12:36,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:12:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-26 21:12:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:12:36,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:36,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:12:36,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:36,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-26 21:12:36,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:36,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:36,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:36,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:36,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:36,532 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-26 21:12:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:37,209 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-26 21:12:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:12:37,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 21:12:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:37,211 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:12:37,212 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 21:12:37,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:12:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 21:12:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-26 21:12:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:12:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-26 21:12:37,231 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-26 21:12:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:37,231 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-26 21:12:37,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-26 21:12:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:12:37,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:37,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:12:37,234 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-26 21:12:37,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:37,333 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:37,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:37,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:37,335 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-26 21:12:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:37,639 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-26 21:12:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:12:37,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 21:12:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:37,644 INFO L225 Difference]: With dead ends: 54 [2018-09-26 21:12:37,644 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 21:12:37,645 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-09-26 21:12:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 21:12:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-26 21:12:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 21:12:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-26 21:12:37,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-26 21:12:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:37,665 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-26 21:12:37,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-26 21:12:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:37,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:37,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:37,668 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:37,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-26 21:12:37,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:37,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:37,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:37,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:37,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:37,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:37,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:38,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:38,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:12:38,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:12:38,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:12:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:12:38,090 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-09-26 21:12:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:39,285 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-09-26 21:12:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:12:39,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-09-26 21:12:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:39,288 INFO L225 Difference]: With dead ends: 107 [2018-09-26 21:12:39,288 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 21:12:39,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-09-26 21:12:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 21:12:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-09-26 21:12:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 21:12:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-09-26 21:12:39,306 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-09-26 21:12:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:39,306 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-09-26 21:12:39,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:12:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-09-26 21:12:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:39,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:39,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:39,308 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:39,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-26 21:12:39,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:39,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:39,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:39,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:39,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:39,455 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-09-26 21:12:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:39,797 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-09-26 21:12:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:12:39,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:12:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:39,799 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:12:39,799 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 21:12:39,800 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-09-26 21:12:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 21:12:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-26 21:12:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:12:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-09-26 21:12:39,816 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-09-26 21:12:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:39,817 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-09-26 21:12:39,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-09-26 21:12:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:39,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:39,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:39,819 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:39,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-26 21:12:39,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:39,884 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:39,885 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:39,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:40,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:40,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-26 21:12:40,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:12:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:12:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:12:40,092 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-09-26 21:12:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:41,920 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-09-26 21:12:41,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:12:41,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-26 21:12:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:41,923 INFO L225 Difference]: With dead ends: 150 [2018-09-26 21:12:41,924 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 21:12:41,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 21:12:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 21:12:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-09-26 21:12:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 21:12:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-09-26 21:12:41,950 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-09-26 21:12:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:41,951 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-09-26 21:12:41,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:12:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-09-26 21:12:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:41,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:41,952 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:41,953 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:41,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-26 21:12:41,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:42,070 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:42,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:42,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:42,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:42,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-09-26 21:12:42,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:12:42,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:12:42,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:12:42,338 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-09-26 21:12:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:43,358 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-26 21:12:43,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:43,359 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-26 21:12:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:43,360 INFO L225 Difference]: With dead ends: 137 [2018-09-26 21:12:43,360 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:12:43,360 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-09-26 21:12:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:12:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-26 21:12:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 21:12:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-26 21:12:43,385 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-26 21:12:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:43,386 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-26 21:12:43,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:12:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-26 21:12:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:43,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:43,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:43,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:43,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-26 21:12:43,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:43,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:43,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:43,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:43,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:43,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:43,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-26 21:12:43,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:12:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:12:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:12:43,712 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-09-26 21:12:44,525 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-26 21:12:44,871 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-26 21:12:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:45,935 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-09-26 21:12:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:12:45,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-09-26 21:12:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:45,937 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:12:45,937 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 21:12:45,938 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-09-26 21:12:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 21:12:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-09-26 21:12:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 21:12:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-09-26 21:12:45,970 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-09-26 21:12:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:45,970 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-09-26 21:12:45,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:12:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-09-26 21:12:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:45,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:45,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:45,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:45,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-26 21:12:45,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:45,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:45,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:46,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:46,043 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:46,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:46,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:46,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:46,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-26 21:12:46,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:12:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:12:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:12:46,164 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-09-26 21:12:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:47,329 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-09-26 21:12:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:12:47,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-26 21:12:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:47,331 INFO L225 Difference]: With dead ends: 246 [2018-09-26 21:12:47,331 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 21:12:47,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:12:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 21:12:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-09-26 21:12:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 21:12:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-09-26 21:12:47,366 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-09-26 21:12:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:47,366 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-09-26 21:12:47,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:12:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-09-26 21:12:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:47,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:47,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:47,368 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-26 21:12:47,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:47,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:47,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:47,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:47,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:47,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:47,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:47,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-09-26 21:12:47,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:47,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:12:47,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:47,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:47,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:47,546 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-09-26 21:12:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:48,039 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-09-26 21:12:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:12:48,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:48,041 INFO L225 Difference]: With dead ends: 252 [2018-09-26 21:12:48,042 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 21:12:48,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:12:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 21:12:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-09-26 21:12:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 21:12:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-09-26 21:12:48,080 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-09-26 21:12:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:48,080 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-09-26 21:12:48,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-09-26 21:12:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:48,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:48,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:48,082 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:48,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-26 21:12:48,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:48,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:48,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:48,295 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:48,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-09-26 21:12:48,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:48,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:48,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:48,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-26 21:12:48,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:12:48,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:12:48,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:12:48,368 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-09-26 21:12:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:48,653 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-09-26 21:12:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:48,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-26 21:12:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:48,656 INFO L225 Difference]: With dead ends: 260 [2018-09-26 21:12:48,656 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 21:12:48,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:12:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 21:12:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-09-26 21:12:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 21:12:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-09-26 21:12:48,693 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-09-26 21:12:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:48,693 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-09-26 21:12:48,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:12:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-09-26 21:12:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:48,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:48,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:48,694 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:48,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-26 21:12:48,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:48,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:48,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:48,786 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:48,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:12:48,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:48,787 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-09-26 21:12:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:49,452 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-09-26 21:12:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:49,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:49,455 INFO L225 Difference]: With dead ends: 316 [2018-09-26 21:12:49,455 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 21:12:49,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:12:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 21:12:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-09-26 21:12:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 21:12:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-09-26 21:12:49,503 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-09-26 21:12:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:49,503 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-09-26 21:12:49,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-09-26 21:12:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:49,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:49,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:49,505 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:49,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:49,505 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-26 21:12:49,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:49,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:49,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:49,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:49,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:49,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:49,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:49,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:49,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:49,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:12:49,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:49,636 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-09-26 21:12:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:50,061 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-09-26 21:12:50,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:12:50,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:50,064 INFO L225 Difference]: With dead ends: 428 [2018-09-26 21:12:50,065 INFO L226 Difference]: Without dead ends: 426 [2018-09-26 21:12:50,065 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-09-26 21:12:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-09-26 21:12:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-09-26 21:12:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 21:12:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-09-26 21:12:50,123 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-09-26 21:12:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-09-26 21:12:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-09-26 21:12:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:50,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:50,124 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:50,125 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:50,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:50,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-26 21:12:50,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:50,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:50,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:50,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:50,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:50,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:50,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:50,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:50,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-26 21:12:50,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:12:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:12:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:12:50,444 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-09-26 21:12:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:51,636 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-09-26 21:12:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:12:51,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-26 21:12:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:51,639 INFO L225 Difference]: With dead ends: 466 [2018-09-26 21:12:51,639 INFO L226 Difference]: Without dead ends: 464 [2018-09-26 21:12:51,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-09-26 21:12:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-26 21:12:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-09-26 21:12:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 21:12:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-09-26 21:12:51,720 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-09-26 21:12:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:51,720 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-09-26 21:12:51,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:12:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-09-26 21:12:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:51,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:51,721 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:51,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:51,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-26 21:12:51,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:51,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:51,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:51,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:52,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:52,317 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:52,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:52,445 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:12:52,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-09-26 21:12:52,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:12:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:12:52,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:12:52,447 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-09-26 21:12:54,899 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-26 21:12:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:55,033 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-09-26 21:12:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:12:55,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-09-26 21:12:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:55,037 INFO L225 Difference]: With dead ends: 859 [2018-09-26 21:12:55,037 INFO L226 Difference]: Without dead ends: 509 [2018-09-26 21:12:55,041 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-09-26 21:12:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-09-26 21:12:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-09-26 21:12:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-26 21:12:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-09-26 21:12:55,126 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-09-26 21:12:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:55,126 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-09-26 21:12:55,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:12:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-09-26 21:12:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:55,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:55,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:55,128 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:55,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-26 21:12:55,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:55,304 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:55,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:55,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:55,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:55,305 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-09-26 21:12:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:56,002 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-09-26 21:12:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:12:56,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 21:12:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:56,005 INFO L225 Difference]: With dead ends: 481 [2018-09-26 21:12:56,005 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 21:12:56,006 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-09-26 21:12:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 21:12:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-09-26 21:12:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 21:12:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-09-26 21:12:56,097 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-09-26 21:12:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:56,097 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-09-26 21:12:56,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-09-26 21:12:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:56,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:56,098 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:56,098 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:56,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-09-26 21:12:56,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:56,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:56,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:56,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:56,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:56,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-26 21:12:56,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:12:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:12:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:12:56,375 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-09-26 21:12:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:57,604 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-09-26 21:12:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:12:57,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-26 21:12:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:57,607 INFO L225 Difference]: With dead ends: 952 [2018-09-26 21:12:57,607 INFO L226 Difference]: Without dead ends: 559 [2018-09-26 21:12:57,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:12:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-26 21:12:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-09-26 21:12:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 21:12:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-09-26 21:12:57,707 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-09-26 21:12:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:57,708 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-09-26 21:12:57,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:12:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-09-26 21:12:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:57,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:57,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:57,709 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:57,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-26 21:12:57,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:57,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:57,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:57,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:57,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:57,827 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-09-26 21:12:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:58,252 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-09-26 21:12:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:58,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-26 21:12:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:58,262 INFO L225 Difference]: With dead ends: 524 [2018-09-26 21:12:58,263 INFO L226 Difference]: Without dead ends: 522 [2018-09-26 21:12:58,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:12:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-26 21:12:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-09-26 21:12:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-26 21:12:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-09-26 21:12:58,374 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-09-26 21:12:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:58,374 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-09-26 21:12:58,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-09-26 21:12:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:58,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:58,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:58,375 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:58,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-26 21:12:58,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:58,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:58,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:58,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:58,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:58,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:59,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:59,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-26 21:12:59,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:59,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:59,229 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-09-26 21:12:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:59,904 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-09-26 21:12:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:12:59,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-26 21:12:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:59,907 INFO L225 Difference]: With dead ends: 556 [2018-09-26 21:12:59,908 INFO L226 Difference]: Without dead ends: 554 [2018-09-26 21:12:59,908 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-09-26 21:12:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-26 21:13:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-09-26 21:13:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-26 21:13:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-09-26 21:13:00,010 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-09-26 21:13:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:00,010 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-09-26 21:13:00,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-09-26 21:13:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:00,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:00,011 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:00,012 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:00,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-26 21:13:00,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:00,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:00,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:00,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:00,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:00,097 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:00,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:00,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:00,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:00,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-09-26 21:13:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:13:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:13:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:13:00,226 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-09-26 21:13:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:01,218 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-09-26 21:13:01,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:01,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-26 21:13:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:01,221 INFO L225 Difference]: With dead ends: 631 [2018-09-26 21:13:01,221 INFO L226 Difference]: Without dead ends: 629 [2018-09-26 21:13:01,222 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-09-26 21:13:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-26 21:13:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-09-26 21:13:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-09-26 21:13:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-09-26 21:13:01,330 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-09-26 21:13:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:01,330 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-09-26 21:13:01,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:13:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-09-26 21:13:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:01,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:01,332 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:01,332 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:01,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-26 21:13:01,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:01,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:01,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:13:01,602 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:13:01,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:13:01,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:01,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:01,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:13:01,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:13:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:13:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:01,628 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-09-26 21:13:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:02,171 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-09-26 21:13:02,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:13:02,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:13:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:02,174 INFO L225 Difference]: With dead ends: 601 [2018-09-26 21:13:02,174 INFO L226 Difference]: Without dead ends: 599 [2018-09-26 21:13:02,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:13:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-26 21:13:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-09-26 21:13:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-26 21:13:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-09-26 21:13:02,293 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-09-26 21:13:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:02,293 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-09-26 21:13:02,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:13:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-09-26 21:13:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:02,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:02,294 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:02,294 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-26 21:13:02,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:02,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:13:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:02,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:02,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:02,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:02,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:02,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:02,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:13:02,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:13:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:13:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:02,453 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-09-26 21:13:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:02,958 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-09-26 21:13:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:13:02,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:13:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:02,960 INFO L225 Difference]: With dead ends: 624 [2018-09-26 21:13:02,961 INFO L226 Difference]: Without dead ends: 622 [2018-09-26 21:13:02,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:13:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-09-26 21:13:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-09-26 21:13:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-09-26 21:13:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-09-26 21:13:03,056 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-09-26 21:13:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:03,056 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-09-26 21:13:03,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:13:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-09-26 21:13:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:03,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:03,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:03,057 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:03,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-26 21:13:03,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:03,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:03,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:03,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:03,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:03,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:03,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:03,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:03,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:03,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:13:03,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:13:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:13:03,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:03,200 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-09-26 21:13:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:03,564 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-09-26 21:13:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:13:03,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:13:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:03,566 INFO L225 Difference]: With dead ends: 584 [2018-09-26 21:13:03,566 INFO L226 Difference]: Without dead ends: 582 [2018-09-26 21:13:03,567 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-09-26 21:13:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-26 21:13:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-09-26 21:13:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-26 21:13:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-09-26 21:13:03,660 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-09-26 21:13:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:03,661 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-09-26 21:13:03,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:13:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-09-26 21:13:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:03,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:03,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:03,661 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:03,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-26 21:13:03,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:03,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:03,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:03,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:03,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:03,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:03,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:03,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:03,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:13:03,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:13:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:13:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:03,817 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-09-26 21:13:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:04,245 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-09-26 21:13:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:13:04,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:13:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:04,248 INFO L225 Difference]: With dead ends: 618 [2018-09-26 21:13:04,249 INFO L226 Difference]: Without dead ends: 616 [2018-09-26 21:13:04,249 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-09-26 21:13:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-09-26 21:13:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-09-26 21:13:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-09-26 21:13:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-09-26 21:13:04,347 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-09-26 21:13:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:04,347 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-09-26 21:13:04,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:13:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-09-26 21:13:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:13:04,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:04,348 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:04,349 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:04,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-26 21:13:04,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:04,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:04,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:04,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:04,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:04,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:13:04,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:13:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:13:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:04,441 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-09-26 21:13:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:04,853 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-09-26 21:13:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:13:04,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 21:13:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:04,856 INFO L225 Difference]: With dead ends: 613 [2018-09-26 21:13:04,856 INFO L226 Difference]: Without dead ends: 611 [2018-09-26 21:13:04,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:13:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-26 21:13:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-09-26 21:13:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-26 21:13:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-09-26 21:13:04,959 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-09-26 21:13:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-09-26 21:13:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:13:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-09-26 21:13:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:04,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:04,960 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:04,960 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-26 21:13:04,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:05,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:05,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:05,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:05,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:05,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:05,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-09-26 21:13:05,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:13:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:13:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:13:05,336 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 12 states. [2018-09-26 21:13:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:06,301 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-09-26 21:13:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:06,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 21:13:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:06,305 INFO L225 Difference]: With dead ends: 875 [2018-09-26 21:13:06,305 INFO L226 Difference]: Without dead ends: 873 [2018-09-26 21:13:06,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:13:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-09-26 21:13:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-09-26 21:13:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-26 21:13:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-09-26 21:13:06,415 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-09-26 21:13:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:06,415 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-09-26 21:13:06,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:13:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-09-26 21:13:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:06,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:06,416 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:06,416 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:06,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-26 21:13:06,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:06,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:06,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:06,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:06,495 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:06,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:06,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:06,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-26 21:13:06,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:13:06,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:13:06,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:13:06,628 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-09-26 21:13:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:08,125 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-09-26 21:13:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:13:08,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 21:13:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:08,130 INFO L225 Difference]: With dead ends: 1281 [2018-09-26 21:13:08,130 INFO L226 Difference]: Without dead ends: 1279 [2018-09-26 21:13:08,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:13:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-09-26 21:13:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-09-26 21:13:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-26 21:13:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-26 21:13:08,314 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-09-26 21:13:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:08,314 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-26 21:13:08,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:13:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-26 21:13:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:13:08,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:08,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:08,315 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:08,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:08,316 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-26 21:13:08,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:08,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:08,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:08,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:08,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:08,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:08,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:08,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:08,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:08,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:13:08,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:13:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:13:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:13:08,475 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-09-26 21:13:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:09,165 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-09-26 21:13:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:13:09,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-26 21:13:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:09,169 INFO L225 Difference]: With dead ends: 1054 [2018-09-26 21:13:09,169 INFO L226 Difference]: Without dead ends: 1052 [2018-09-26 21:13:09,170 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-09-26 21:13:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-09-26 21:13:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-09-26 21:13:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-26 21:13:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-09-26 21:13:09,330 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-09-26 21:13:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:09,330 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-09-26 21:13:09,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:13:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-09-26 21:13:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:13:09,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:09,332 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:09,332 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:09,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-09-26 21:13:09,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:09,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:09,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:13:09,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:13:09,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:13:09,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:09,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:09,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-09-26 21:13:09,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:13:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:13:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:13:09,560 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 12 states. [2018-09-26 21:13:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:10,704 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-09-26 21:13:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:13:10,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-26 21:13:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:10,709 INFO L225 Difference]: With dead ends: 1125 [2018-09-26 21:13:10,709 INFO L226 Difference]: Without dead ends: 1123 [2018-09-26 21:13:10,710 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-09-26 21:13:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-26 21:13:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-09-26 21:13:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-26 21:13:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-26 21:13:10,885 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-09-26 21:13:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:10,886 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-26 21:13:10,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:13:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-26 21:13:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:13:10,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:10,887 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:10,887 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-09-26 21:13:10,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:10,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:10,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:13:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:10,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:10,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:11,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:11,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:11,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:11,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-26 21:13:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:13:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:13:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:13:11,133 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-09-26 21:13:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:12,678 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-09-26 21:13:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:13:12,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 21:13:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:12,682 INFO L225 Difference]: With dead ends: 1125 [2018-09-26 21:13:12,682 INFO L226 Difference]: Without dead ends: 1123 [2018-09-26 21:13:12,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 21:13:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-26 21:13:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-09-26 21:13:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-09-26 21:13:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-09-26 21:13:12,862 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-09-26 21:13:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:12,863 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-09-26 21:13:12,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:13:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-09-26 21:13:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:13:12,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:12,864 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:12,864 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:12,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-26 21:13:12,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:12,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:12,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:12,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:12,953 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:12,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:12,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:12,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:13,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:13,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-09-26 21:13:13,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:13:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:13:13,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:13:13,021 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-09-26 21:13:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:13,834 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-09-26 21:13:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:13:13,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-26 21:13:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:13,838 INFO L225 Difference]: With dead ends: 1117 [2018-09-26 21:13:13,838 INFO L226 Difference]: Without dead ends: 1115 [2018-09-26 21:13:13,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-09-26 21:13:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-09-26 21:13:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-09-26 21:13:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-09-26 21:13:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-09-26 21:13:14,003 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-09-26 21:13:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:14,003 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-09-26 21:13:14,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:13:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-09-26 21:13:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:13:14,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:14,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:14,004 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:14,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-26 21:13:14,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:14,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:14,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:14,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:14,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:14,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:14,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:14,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:14,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:14,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:14,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:13:14,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:13:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:13:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:13:14,220 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-09-26 21:13:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:15,001 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-09-26 21:13:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:13:15,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-26 21:13:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:15,005 INFO L225 Difference]: With dead ends: 995 [2018-09-26 21:13:15,005 INFO L226 Difference]: Without dead ends: 993 [2018-09-26 21:13:15,006 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-09-26 21:13:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-09-26 21:13:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-09-26 21:13:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-09-26 21:13:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-09-26 21:13:15,174 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-09-26 21:13:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:15,175 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-09-26 21:13:15,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:13:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-09-26 21:13:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:15,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:15,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:13:15,176 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:15,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-09-26 21:13:15,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:15,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:15,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:15,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:15,946 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-09-26 21:13:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:16,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:16,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:16,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:16,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:16,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:16,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-26 21:13:16,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:13:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:13:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:13:16,161 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-09-26 21:13:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:18,670 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-09-26 21:13:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:13:18,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-26 21:13:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:18,675 INFO L225 Difference]: With dead ends: 2105 [2018-09-26 21:13:18,675 INFO L226 Difference]: Without dead ends: 1229 [2018-09-26 21:13:18,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=635, Invalid=2557, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 21:13:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-09-26 21:13:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-09-26 21:13:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-09-26 21:13:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-09-26 21:13:18,899 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-09-26 21:13:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:18,899 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-09-26 21:13:18,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:13:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-09-26 21:13:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:18,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:18,900 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:18,900 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:18,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-09-26 21:13:18,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:18,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:19,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:19,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:19,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:19,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:19,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:13:19,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:19,160 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-09-26 21:13:19,905 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-09-26 21:13:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:21,521 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-09-26 21:13:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:13:21,521 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:13:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:21,525 INFO L225 Difference]: With dead ends: 2110 [2018-09-26 21:13:21,525 INFO L226 Difference]: Without dead ends: 1097 [2018-09-26 21:13:21,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2024, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:13:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-26 21:13:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-09-26 21:13:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-26 21:13:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-09-26 21:13:21,737 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-09-26 21:13:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:21,738 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-09-26 21:13:21,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-09-26 21:13:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:21,738 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:21,739 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:21,739 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:21,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-09-26 21:13:21,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:21,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:21,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:21,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:21,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:21,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:21,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:22,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:22,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:22,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:13:22,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:22,160 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-09-26 21:13:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:24,528 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-09-26 21:13:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:13:24,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:13:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:24,535 INFO L225 Difference]: With dead ends: 2832 [2018-09-26 21:13:24,535 INFO L226 Difference]: Without dead ends: 1867 [2018-09-26 21:13:24,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=702, Invalid=3330, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:13:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-09-26 21:13:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-09-26 21:13:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-09-26 21:13:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-09-26 21:13:24,893 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-09-26 21:13:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:24,893 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-09-26 21:13:24,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-09-26 21:13:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:24,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:24,894 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:24,895 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:24,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-26 21:13:24,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:24,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:24,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:24,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:25,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:13:25,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:25,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-26 21:13:25,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:25,115 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-09-26 21:13:28,587 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-26 21:13:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:29,505 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-09-26 21:13:29,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:13:29,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:13:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:29,532 INFO L225 Difference]: With dead ends: 4461 [2018-09-26 21:13:29,534 INFO L226 Difference]: Without dead ends: 2887 [2018-09-26 21:13:29,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1321, Invalid=5159, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 21:13:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-09-26 21:13:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-09-26 21:13:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-09-26 21:13:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-09-26 21:13:30,475 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-09-26 21:13:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-09-26 21:13:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-09-26 21:13:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:30,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:30,477 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:13:30,477 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:30,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-26 21:13:30,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:30,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:30,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:30,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:13:30,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:30,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:13:30,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:13:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:13:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:13:30,778 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-09-26 21:13:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:34,715 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-09-26 21:13:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 21:13:34,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 21:13:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:34,722 INFO L225 Difference]: With dead ends: 3903 [2018-09-26 21:13:34,723 INFO L226 Difference]: Without dead ends: 3227 [2018-09-26 21:13:34,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1137, Invalid=6873, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:13:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-09-26 21:13:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-09-26 21:13:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-09-26 21:13:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-09-26 21:13:35,391 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-09-26 21:13:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:35,392 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-09-26 21:13:35,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:13:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-09-26 21:13:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:35,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:35,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:35,393 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:35,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-09-26 21:13:35,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:35,783 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:35,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:35,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:35,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:35,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:35,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-26 21:13:35,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:35,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:35,891 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-09-26 21:13:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:38,751 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-09-26 21:13:38,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:13:38,751 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:13:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:38,759 INFO L225 Difference]: With dead ends: 5427 [2018-09-26 21:13:38,759 INFO L226 Difference]: Without dead ends: 2851 [2018-09-26 21:13:38,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 21:13:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-09-26 21:13:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-09-26 21:13:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-09-26 21:13:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-09-26 21:13:39,348 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-09-26 21:13:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:39,348 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-09-26 21:13:39,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-09-26 21:13:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:13:39,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:39,350 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:13:39,350 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:39,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-09-26 21:13:39,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:39,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:39,453 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:39,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:39,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:39,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:13:39,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:39,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:13:39,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:39,609 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-09-26 21:13:41,995 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-09-26 21:13:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:42,566 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-09-26 21:13:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:13:42,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 21:13:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:42,572 INFO L225 Difference]: With dead ends: 5837 [2018-09-26 21:13:42,572 INFO L226 Difference]: Without dead ends: 3072 [2018-09-26 21:13:42,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=785, Invalid=3247, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:13:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-09-26 21:13:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-09-26 21:13:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-26 21:13:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-09-26 21:13:43,269 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-09-26 21:13:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:43,269 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-09-26 21:13:43,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-09-26 21:13:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:13:43,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:43,271 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:13:43,271 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:43,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-09-26 21:13:43,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:43,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:43,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:13:43,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:43,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:43,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:43,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:43,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:43,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-26 21:13:43,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:13:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:13:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:13:43,646 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-09-26 21:13:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:49,607 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-09-26 21:13:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 21:13:49,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-09-26 21:13:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:49,614 INFO L225 Difference]: With dead ends: 5120 [2018-09-26 21:13:49,615 INFO L226 Difference]: Without dead ends: 3342 [2018-09-26 21:13:49,621 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-09-26 21:13:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-09-26 21:13:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-09-26 21:13:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-09-26 21:13:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-09-26 21:13:50,326 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-09-26 21:13:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:50,326 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-09-26 21:13:50,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:13:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-09-26 21:13:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:13:50,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:50,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:50,328 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:50,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-09-26 21:13:50,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:50,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:50,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:50,582 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:50,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:50,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:50,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:13:50,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:50,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-09-26 21:13:50,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:13:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:13:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:13:50,696 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 16 states. [2018-09-26 21:13:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:53,793 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-09-26 21:13:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:13:53,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:13:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:53,799 INFO L225 Difference]: With dead ends: 3487 [2018-09-26 21:13:53,800 INFO L226 Difference]: Without dead ends: 3485 [2018-09-26 21:13:53,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 21:13:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-09-26 21:13:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-09-26 21:13:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-09-26 21:13:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-09-26 21:13:54,684 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-09-26 21:13:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:54,685 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-09-26 21:13:54,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:13:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-09-26 21:13:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:13:54,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:54,686 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:54,686 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:54,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-09-26 21:13:54,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:54,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:54,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:54,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:54,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:54,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:13:54,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:54,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-09-26 21:13:54,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:13:54,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:13:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:13:54,914 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 15 states. [2018-09-26 21:13:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:57,982 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-09-26 21:13:57,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:13:57,982 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-26 21:13:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:57,989 INFO L225 Difference]: With dead ends: 3557 [2018-09-26 21:13:57,989 INFO L226 Difference]: Without dead ends: 3555 [2018-09-26 21:13:57,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=674, Invalid=3486, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 21:13:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-09-26 21:13:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-09-26 21:13:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-09-26 21:13:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-09-26 21:13:58,817 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-09-26 21:13:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:58,818 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-09-26 21:13:58,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:13:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-09-26 21:13:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:13:58,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:58,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:58,819 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:58,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-09-26 21:13:58,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:58,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:58,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:59,181 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:59,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:13:59,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:13:59,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:13:59,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:59,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:59,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-26 21:13:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:13:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:13:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:13:59,329 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-09-26 21:14:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:07,410 INFO L93 Difference]: Finished difference Result 5252 states and 8823 transitions. [2018-09-26 21:14:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 21:14:07,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:14:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:07,415 INFO L225 Difference]: With dead ends: 5252 [2018-09-26 21:14:07,415 INFO L226 Difference]: Without dead ends: 5250 [2018-09-26 21:14:07,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7869 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2825, Invalid=16915, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 21:14:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2018-09-26 21:14:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 3515. [2018-09-26 21:14:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-09-26 21:14:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-09-26 21:14:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-09-26 21:14:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:08,169 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-09-26 21:14:08,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:14:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-09-26 21:14:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:08,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:08,170 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:08,171 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:08,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-09-26 21:14:08,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:08,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:14:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:08,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:08,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:14:08,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:14:08,318 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:14:08,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:14:08,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:08,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:08,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-26 21:14:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:14:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:14:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:14:08,500 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-09-26 21:14:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:16,149 INFO L93 Difference]: Finished difference Result 4843 states and 8107 transitions. [2018-09-26 21:14:16,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 21:14:16,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:14:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:16,155 INFO L225 Difference]: With dead ends: 4843 [2018-09-26 21:14:16,155 INFO L226 Difference]: Without dead ends: 4841 [2018-09-26 21:14:16,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6131 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2645, Invalid=12855, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 21:14:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2018-09-26 21:14:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3405. [2018-09-26 21:14:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-09-26 21:14:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-09-26 21:14:16,960 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-09-26 21:14:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:16,960 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-09-26 21:14:16,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:14:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-09-26 21:14:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:16,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:16,961 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:16,962 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-09-26 21:14:16,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:16,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:16,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:14:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:17,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:17,108 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-09-26 21:14:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:14:17,127 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:14:17,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:14:17,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:14:17,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:17,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-26 21:14:17,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:14:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:14:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:14:17,217 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-09-26 21:14:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:20,077 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-09-26 21:14:20,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:14:20,078 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:14:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:20,082 INFO L225 Difference]: With dead ends: 5774 [2018-09-26 21:14:20,082 INFO L226 Difference]: Without dead ends: 3100 [2018-09-26 21:14:20,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=695, Invalid=2385, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:14:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-09-26 21:14:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-09-26 21:14:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-09-26 21:14:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-09-26 21:14:20,695 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-09-26 21:14:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:20,696 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-09-26 21:14:20,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:14:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-09-26 21:14:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:20,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:20,697 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:20,697 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:20,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-09-26 21:14:20,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:20,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:20,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:14:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:20,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:20,787 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-09-26 21:14:20,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:20,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:14:20,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:20,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-09-26 21:14:20,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:14:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:14:20,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:14:20,894 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 15 states. [2018-09-26 21:14:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:23,436 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-09-26 21:14:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:14:23,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-26 21:14:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:23,438 INFO L225 Difference]: With dead ends: 3114 [2018-09-26 21:14:23,438 INFO L226 Difference]: Without dead ends: 3112 [2018-09-26 21:14:23,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=1847, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:14:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-09-26 21:14:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-09-26 21:14:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-09-26 21:14:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-09-26 21:14:24,085 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-09-26 21:14:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-09-26 21:14:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:14:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-09-26 21:14:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:24,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:24,086 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:24,086 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:24,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-09-26 21:14:24,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:24,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:24,225 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-09-26 21:14:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:14:24,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:14:24,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:14:24,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:24,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:24,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-09-26 21:14:24,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:24,367 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-09-26 21:14:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:29,720 INFO L93 Difference]: Finished difference Result 4415 states and 7404 transitions. [2018-09-26 21:14:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 21:14:29,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-26 21:14:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:29,724 INFO L225 Difference]: With dead ends: 4415 [2018-09-26 21:14:29,724 INFO L226 Difference]: Without dead ends: 4413 [2018-09-26 21:14:29,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1803, Invalid=6939, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:14:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-09-26 21:14:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3073. [2018-09-26 21:14:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-09-26 21:14:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-09-26 21:14:30,513 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-09-26 21:14:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:30,513 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-09-26 21:14:30,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:14:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-09-26 21:14:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:30,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:30,514 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:30,514 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:30,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-09-26 21:14:30,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:30,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:14:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:30,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:30,641 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-09-26 21:14:30,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:30,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:30,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:30,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-09-26 21:14:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:14:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:14:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:14:30,772 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 16 states. [2018-09-26 21:14:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:34,883 INFO L93 Difference]: Finished difference Result 4429 states and 7411 transitions. [2018-09-26 21:14:34,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:14:34,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:14:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:34,887 INFO L225 Difference]: With dead ends: 4429 [2018-09-26 21:14:34,888 INFO L226 Difference]: Without dead ends: 4427 [2018-09-26 21:14:34,889 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-09-26 21:14:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2018-09-26 21:14:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 2723. [2018-09-26 21:14:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-09-26 21:14:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-09-26 21:14:35,608 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-09-26 21:14:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:35,608 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-09-26 21:14:35,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:14:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-09-26 21:14:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:35,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:35,609 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:35,609 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:35,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-09-26 21:14:35,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:35,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:35,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:35,706 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:35,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 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-09-26 21:14:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:35,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:35,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:35,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-26 21:14:35,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:14:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:14:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:14:35,885 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 18 states. [2018-09-26 21:14:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:40,519 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-09-26 21:14:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 21:14:40,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:14:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:40,525 INFO L225 Difference]: With dead ends: 4290 [2018-09-26 21:14:40,525 INFO L226 Difference]: Without dead ends: 4288 [2018-09-26 21:14:40,526 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-09-26 21:14:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-09-26 21:14:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-09-26 21:14:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-09-26 21:14:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-09-26 21:14:41,556 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-09-26 21:14:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:41,556 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-09-26 21:14:41,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:14:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-09-26 21:14:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:14:41,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:41,558 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:41,558 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:41,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-09-26 21:14:41,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:41,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:41,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:41,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:41,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:14:41,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:14:41,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-26 21:14:41,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:14:41,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:14:41,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:41,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-26 21:14:41,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:14:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:14:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:14:41,899 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 18 states. [2018-09-26 21:14:47,442 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-09-26 21:14:50,432 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-26 21:14:53,229 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-09-26 21:14:53,687 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-26 21:14:54,258 WARN L178 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-26 21:14:54,755 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-26 21:14:55,948 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-09-26 21:14:56,785 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-09-26 21:14:57,505 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-26 21:14:58,251 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-09-26 21:14:59,314 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-26 21:15:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:05,122 INFO L93 Difference]: Finished difference Result 9624 states and 16323 transitions. [2018-09-26 21:15:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 21:15:05,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 21:15:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:05,131 INFO L225 Difference]: With dead ends: 9624 [2018-09-26 21:15:05,131 INFO L226 Difference]: Without dead ends: 9622 [2018-09-26 21:15:05,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16036 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=6166, Invalid=32839, Unknown=1, NotChecked=0, Total=39006 [2018-09-26 21:15:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2018-09-26 21:15:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 3326. [2018-09-26 21:15:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-09-26 21:15:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 5536 transitions. [2018-09-26 21:15:06,179 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 5536 transitions. Word has length 18 [2018-09-26 21:15:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:06,179 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 5536 transitions. [2018-09-26 21:15:06,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:15:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 5536 transitions. [2018-09-26 21:15:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:15:06,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:06,181 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:06,181 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:06,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-09-26 21:15:06,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:06,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:15:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:06,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:06,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:15:06,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:06,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:15:06,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:06,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-09-26 21:15:06,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:06,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:06,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:06,474 INFO L87 Difference]: Start difference. First operand 3326 states and 5536 transitions. Second operand 17 states. [2018-09-26 21:15:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:12,239 INFO L93 Difference]: Finished difference Result 5572 states and 9460 transitions. [2018-09-26 21:15:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 21:15:12,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-26 21:15:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:12,243 INFO L225 Difference]: With dead ends: 5572 [2018-09-26 21:15:12,244 INFO L226 Difference]: Without dead ends: 5570 [2018-09-26 21:15:12,244 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-09-26 21:15:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2018-09-26 21:15:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3526. [2018-09-26 21:15:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-09-26 21:15:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5899 transitions. [2018-09-26 21:15:13,443 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5899 transitions. Word has length 18 [2018-09-26 21:15:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:13,443 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5899 transitions. [2018-09-26 21:15:13,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5899 transitions. [2018-09-26 21:15:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:15:13,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:13,444 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:13,444 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:13,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:13,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-09-26 21:15:13,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:13,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:13,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:13,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:13,685 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-09-26 21:15:13,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:15:13,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:15:13,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:15:13,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:15:13,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:13,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-09-26 21:15:13,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:13,800 INFO L87 Difference]: Start difference. First operand 3526 states and 5899 transitions. Second operand 17 states. [2018-09-26 21:15:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:18,277 INFO L93 Difference]: Finished difference Result 4458 states and 7480 transitions. [2018-09-26 21:15:18,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 21:15:18,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-26 21:15:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:18,282 INFO L225 Difference]: With dead ends: 4458 [2018-09-26 21:15:18,282 INFO L226 Difference]: Without dead ends: 4456 [2018-09-26 21:15:18,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=904, Invalid=5258, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 21:15:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-09-26 21:15:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3633. [2018-09-26 21:15:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2018-09-26 21:15:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6081 transitions. [2018-09-26 21:15:19,648 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6081 transitions. Word has length 18 [2018-09-26 21:15:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:19,648 INFO L480 AbstractCegarLoop]: Abstraction has 3633 states and 6081 transitions. [2018-09-26 21:15:19,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6081 transitions. [2018-09-26 21:15:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:15:19,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:19,649 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:19,649 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:19,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-09-26 21:15:19,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:19,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:19,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:19,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:15:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:19,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:19,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:15:19,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:19,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:15:20,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:20,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-09-26 21:15:20,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 21:15:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 21:15:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-26 21:15:20,418 INFO L87 Difference]: Start difference. First operand 3633 states and 6081 transitions. Second operand 21 states. [2018-09-26 21:15:20,889 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-26 21:15:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:24,861 INFO L93 Difference]: Finished difference Result 4389 states and 7355 transitions. [2018-09-26 21:15:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:15:24,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-09-26 21:15:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:24,865 INFO L225 Difference]: With dead ends: 4389 [2018-09-26 21:15:24,865 INFO L226 Difference]: Without dead ends: 4376 [2018-09-26 21:15:24,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 21:15:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-09-26 21:15:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4152. [2018-09-26 21:15:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2018-09-26 21:15:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6931 transitions. [2018-09-26 21:15:26,354 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6931 transitions. Word has length 19 [2018-09-26 21:15:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 4152 states and 6931 transitions. [2018-09-26 21:15:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 21:15:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6931 transitions. [2018-09-26 21:15:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:15:26,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:26,356 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:26,356 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:26,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-09-26 21:15:26,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:26,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:26,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:26,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:26,487 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-09-26 21:15:26,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:26,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:26,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:26,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-09-26 21:15:26,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 21:15:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 21:15:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:15:26,637 INFO L87 Difference]: Start difference. First operand 4152 states and 6931 transitions. Second operand 19 states. [2018-09-26 21:15:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:34,310 INFO L93 Difference]: Finished difference Result 7602 states and 12857 transitions. [2018-09-26 21:15:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 21:15:34,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 21:15:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:34,317 INFO L225 Difference]: With dead ends: 7602 [2018-09-26 21:15:34,317 INFO L226 Difference]: Without dead ends: 7553 [2018-09-26 21:15:34,319 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-09-26 21:15:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2018-09-26 21:15:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5765. [2018-09-26 21:15:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2018-09-26 21:15:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9725 transitions. [2018-09-26 21:15:36,665 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 9725 transitions. Word has length 19 [2018-09-26 21:15:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:36,665 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 9725 transitions. [2018-09-26 21:15:36,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 21:15:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 9725 transitions. [2018-09-26 21:15:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:15:36,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:36,667 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:36,667 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:36,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-09-26 21:15:36,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:36,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:36,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:36,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:15:36,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:36,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:15:36,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:36,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-09-26 21:15:36,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:15:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:15:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:15:36,948 INFO L87 Difference]: Start difference. First operand 5765 states and 9725 transitions. Second operand 18 states. [2018-09-26 21:15:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:48,138 INFO L93 Difference]: Finished difference Result 10730 states and 18220 transitions. [2018-09-26 21:15:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 21:15:48,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-09-26 21:15:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:48,148 INFO L225 Difference]: With dead ends: 10730 [2018-09-26 21:15:48,148 INFO L226 Difference]: Without dead ends: 10673 [2018-09-26 21:15:48,150 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-09-26 21:15:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2018-09-26 21:15:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 5867. [2018-09-26 21:15:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5867 states. [2018-09-26 21:15:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 9873 transitions. [2018-09-26 21:15:50,841 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 9873 transitions. Word has length 19 [2018-09-26 21:15:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:50,841 INFO L480 AbstractCegarLoop]: Abstraction has 5867 states and 9873 transitions. [2018-09-26 21:15:50,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:15:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 9873 transitions. [2018-09-26 21:15:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:15:50,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:50,843 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:15:50,843 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:50,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash -298147634, now seen corresponding path program 2 times [2018-09-26 21:15:50,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:15:50,960 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:50,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:15:50,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:15:50,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:15:50,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:15:50,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:15:51,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:51,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-09-26 21:15:51,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:15:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:15:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:15:51,118 INFO L87 Difference]: Start difference. First operand 5867 states and 9873 transitions. Second operand 20 states. [2018-09-26 21:15:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:56,226 INFO L93 Difference]: Finished difference Result 12951 states and 21640 transitions. [2018-09-26 21:15:56,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:15:56,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-26 21:15:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:56,234 INFO L225 Difference]: With dead ends: 12951 [2018-09-26 21:15:56,234 INFO L226 Difference]: Without dead ends: 7453 [2018-09-26 21:15:56,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 21:15:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2018-09-26 21:15:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 6977. [2018-09-26 21:15:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-09-26 21:15:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 11514 transitions. [2018-09-26 21:15:59,370 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 11514 transitions. Word has length 21 [2018-09-26 21:15:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:59,371 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 11514 transitions. [2018-09-26 21:15:59,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:15:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 11514 transitions. [2018-09-26 21:15:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:15:59,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:59,373 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:59,373 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:59,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 1 times [2018-09-26 21:15:59,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:59,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:15:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:59,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:59,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:15:59,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:59,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:15:59,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:59,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-09-26 21:15:59,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:59,617 INFO L87 Difference]: Start difference. First operand 6977 states and 11514 transitions. Second operand 17 states. [2018-09-26 21:16:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:05,140 INFO L93 Difference]: Finished difference Result 7309 states and 12055 transitions. [2018-09-26 21:16:05,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:16:05,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-09-26 21:16:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:05,147 INFO L225 Difference]: With dead ends: 7309 [2018-09-26 21:16:05,147 INFO L226 Difference]: Without dead ends: 7307 [2018-09-26 21:16:05,149 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-09-26 21:16:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-09-26 21:16:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 6935. [2018-09-26 21:16:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6935 states. [2018-09-26 21:16:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 11445 transitions. [2018-09-26 21:16:08,287 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 11445 transitions. Word has length 21 [2018-09-26 21:16:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:08,287 INFO L480 AbstractCegarLoop]: Abstraction has 6935 states and 11445 transitions. [2018-09-26 21:16:08,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:16:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 11445 transitions. [2018-09-26 21:16:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:16:08,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:08,289 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:08,289 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:08,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1010297104, now seen corresponding path program 1 times [2018-09-26 21:16:08,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:08,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:08,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:16:08,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:08,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:16:08,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:08,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:16:09,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:09,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-09-26 21:16:09,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 21:16:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 21:16:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-09-26 21:16:09,072 INFO L87 Difference]: Start difference. First operand 6935 states and 11445 transitions. Second operand 21 states. [2018-09-26 21:16:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:15,593 INFO L93 Difference]: Finished difference Result 11330 states and 18599 transitions. [2018-09-26 21:16:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:16:15,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 21:16:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:15,600 INFO L225 Difference]: With dead ends: 11330 [2018-09-26 21:16:15,600 INFO L226 Difference]: Without dead ends: 7599 [2018-09-26 21:16:15,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=590, Invalid=3442, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:16:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-09-26 21:16:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 6837. [2018-09-26 21:16:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-09-26 21:16:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 11276 transitions. [2018-09-26 21:16:18,670 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 11276 transitions. Word has length 21 [2018-09-26 21:16:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:18,670 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 11276 transitions. [2018-09-26 21:16:18,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 21:16:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 11276 transitions. [2018-09-26 21:16:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:16:18,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:18,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:18,672 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:18,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash -972124902, now seen corresponding path program 1 times [2018-09-26 21:16:18,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:18,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:18,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:16:18,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:18,867 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-09-26 21:16:18,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:18,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 21:16:18,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:18,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-09-26 21:16:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:16:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:16:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:16:18,968 INFO L87 Difference]: Start difference. First operand 6837 states and 11276 transitions. Second operand 15 states. [2018-09-26 21:16:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:23,667 INFO L93 Difference]: Finished difference Result 7136 states and 11762 transitions. [2018-09-26 21:16:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:16:23,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-09-26 21:16:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:23,675 INFO L225 Difference]: With dead ends: 7136 [2018-09-26 21:16:23,675 INFO L226 Difference]: Without dead ends: 7134 [2018-09-26 21:16:23,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 21:16:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2018-09-26 21:16:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 6814. [2018-09-26 21:16:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2018-09-26 21:16:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 11236 transitions. [2018-09-26 21:16:26,810 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 11236 transitions. Word has length 21 [2018-09-26 21:16:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:26,810 INFO L480 AbstractCegarLoop]: Abstraction has 6814 states and 11236 transitions. [2018-09-26 21:16:26,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:16:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 11236 transitions. [2018-09-26 21:16:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:16:26,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:26,812 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:16:26,812 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:26,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:26,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 4 times [2018-09-26 21:16:26,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:26,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:16:26,937 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:26,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:16:26,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:16:26,953 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:16:26,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:16:26,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:16:27,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:27,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-26 21:16:27,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:16:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:16:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:16:27,133 INFO L87 Difference]: Start difference. First operand 6814 states and 11236 transitions. Second operand 20 states. [2018-09-26 21:16:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:39,946 INFO L93 Difference]: Finished difference Result 19394 states and 31307 transitions. [2018-09-26 21:16:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 21:16:39,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-26 21:16:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:39,956 INFO L225 Difference]: With dead ends: 19394 [2018-09-26 21:16:39,956 INFO L226 Difference]: Without dead ends: 12053 [2018-09-26 21:16:39,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6952 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2115, Invalid=16245, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:16:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2018-09-26 21:16:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 9291. [2018-09-26 21:16:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2018-09-26 21:16:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 15178 transitions. [2018-09-26 21:16:44,345 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 15178 transitions. Word has length 21 [2018-09-26 21:16:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:44,345 INFO L480 AbstractCegarLoop]: Abstraction has 9291 states and 15178 transitions. [2018-09-26 21:16:44,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:16:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 15178 transitions. [2018-09-26 21:16:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:16:44,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:44,347 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:44,347 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:44,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1688920231, now seen corresponding path program 1 times [2018-09-26 21:16:44,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:44,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:44,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:16:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:16:44,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:44,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:16:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:44,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:16:44,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:44,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-09-26 21:16:44,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:16:44,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:16:44,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:16:44,562 INFO L87 Difference]: Start difference. First operand 9291 states and 15178 transitions. Second operand 17 states. Received shutdown request... [2018-09-26 21:16:49,541 WARN L186 SmtUtils]: Removed 1 from assertion stack [2018-09-26 21:16:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 21:16:49,541 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:16:49,545 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:16:49,545 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:16:49 BoogieIcfgContainer [2018-09-26 21:16:49,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:16:49,546 INFO L168 Benchmark]: Toolchain (without parser) took 255227.94 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -479.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 21:16:49,547 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:49,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:49,548 INFO L168 Benchmark]: Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:49,548 INFO L168 Benchmark]: RCFGBuilder took 422.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:49,549 INFO L168 Benchmark]: TraceAbstraction took 254735.02 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -501.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 21:16:49,551 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 422.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254735.02 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -501.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (9291states) and FLOYD_HOARE automaton (currently 78 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (9291states) and FLOYD_HOARE automaton (currently 78 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (9291states) and FLOYD_HOARE automaton (currently 78 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (9291states) and FLOYD_HOARE automaton (currently 78 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 254.6s OverallTime, 62 OverallIterations, 4 TraceHistogramMax, 194.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2169 SDtfs, 11121 SDslu, 7178 SDs, 0 SdLazy, 58291 SolverSat, 7594 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 57.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3437 GetRequests, 527 SyntacticMatches, 21 SemanticMatches, 2888 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 78362 ImplicationChecksByTransitivity, 80.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9291occurred in iteration=61, 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: 41.1s AutomataMinimizationTime, 61 MinimizatonAttempts, 35849 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 1636 NumberOfCodeBlocks, 1636 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1520 ConstructedInterpolants, 92 QuantifiedInterpolants, 150568 SizeOfPredicates, 241 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 520 ConjunctsInUnsatCore, 116 InterpolantComputations, 9 PerfectInterpolantSequences, 203/944 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-09-26_21-16-49-564.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-09-26_21-16-49-564.csv Completed graceful shutdown