java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:20:09,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:20:09,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:20:09,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:20:09,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:20:09,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:20:09,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:20:09,150 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:20:09,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:20:09,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:20:09,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:20:09,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:20:09,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:20:09,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:20:09,163 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:20:09,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:20:09,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:20:09,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:20:09,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:20:09,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:20:09,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:20:09,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:20:09,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:20:09,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:20:09,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:20:09,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:20:09,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:20:09,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:20:09,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:20:09,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:20:09,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:20:09,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:20:09,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:20:09,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:20:09,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:20:09,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:20:09,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:20:09,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:20:09,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:20:09,232 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:20:09,232 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:20:09,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:20:09,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:20:09,233 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:20:09,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:20:09,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:20:09,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:20:09,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:20:09,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:20:09,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:20:09,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:20:09,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:20:09,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:20:09,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:20:09,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:20:09,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:20:09,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:20:09,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:20:09,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:20:09,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:20:09,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:20:09,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:20:09,237 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:20:09,237 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:20:09,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:20:09,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:20:09,238 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:20:09,238 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:20:09,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:20:09,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:20:09,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:20:09,331 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:20:09,332 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:20:09,332 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-10-04 14:20:09,333 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-04 14:20:09,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:20:09,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:20:09,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:20:09,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:20:09,392 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:20:09,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,433 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:20:09,434 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:20:09,434 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:20:09,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:20:09,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:20:09,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:20:09,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:20:09,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... [2018-10-04 14:20:09,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:20:09,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:20:09,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:20:09,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:20:09,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:20:09,530 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 14:20:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 14:20:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 14:20:09,922 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:20:09,923 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:20:09 BoogieIcfgContainer [2018-10-04 14:20:09,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:20:09,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:20:09,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:20:09,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:20:09,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:20:09" (1/2) ... [2018-10-04 14:20:09,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9eb6b7 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:20:09, skipping insertion in model container [2018-10-04 14:20:09,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:20:09" (2/2) ... [2018-10-04 14:20:09,931 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-04 14:20:09,941 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:20:09,953 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 14:20:09,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:20:09,998 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:20:09,999 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:20:09,999 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:20:09,999 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:20:09,999 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:20:09,999 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:20:10,000 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:20:10,000 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:20:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 14:20:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:20:10,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:10,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:20:10,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:10,031 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-04 14:20:10,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:10,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:10,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:20:10,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:20:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:20:10,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:10,274 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-04 14:20:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:10,748 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-04 14:20:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:20:10,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 14:20:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:10,764 INFO L225 Difference]: With dead ends: 32 [2018-10-04 14:20:10,764 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 14:20:10,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:20:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 14:20:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-04 14:20:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:20:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-04 14:20:10,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-04 14:20:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:10,806 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-04 14:20:10,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:20:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-04 14:20:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:20:10,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:10,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:20:10,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:10,809 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-04 14:20:10,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:10,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:10,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:10,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:20:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:20:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:20:10,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:10,932 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-04 14:20:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:11,239 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-04 14:20:11,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:20:11,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 14:20:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:11,241 INFO L225 Difference]: With dead ends: 38 [2018-10-04 14:20:11,241 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:20:11,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:20:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:20:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-04 14:20:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:20:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-04 14:20:11,250 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-04 14:20:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:11,251 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-04 14:20:11,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:20:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-04 14:20:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:20:11,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:11,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:20:11,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:11,252 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-04 14:20:11,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:11,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:11,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:20:11,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:20:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:20:11,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:11,347 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-04 14:20:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,143 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-04 14:20:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:12,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 14:20:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,147 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:20:12,147 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:20:12,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 14:20:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:20:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-04 14:20:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:20:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-04 14:20:12,157 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-04 14:20:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,158 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-04 14:20:12,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:20:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-04 14:20:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:20:12,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:20:12,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,160 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-04 14:20:12,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:12,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:20:12,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:20:12,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:20:12,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,324 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-04 14:20:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,594 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-04 14:20:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:20:12,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 14:20:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,597 INFO L225 Difference]: With dead ends: 54 [2018-10-04 14:20:12,597 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 14:20:12,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:20:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 14:20:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-04 14:20:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:20:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-04 14:20:12,609 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-04 14:20:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,609 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-04 14:20:12,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:20:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-04 14:20:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:12,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,610 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,611 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-04 14:20:12,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:12,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:13,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:13,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:13,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:13,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:13,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:13,132 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-04 14:20:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,284 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-04 14:20:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:20:14,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-04 14:20:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,290 INFO L225 Difference]: With dead ends: 107 [2018-10-04 14:20:14,291 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 14:20:14,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 12 [2018-10-04 14:20:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 14:20:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-04 14:20:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:20:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-04 14:20:14,315 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-04 14:20:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-04 14:20:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-04 14:20:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:14,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:14,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:14,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:14,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-04 14:20:14,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:14,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:14,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:14,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:14,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:14,442 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-04 14:20:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,841 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-04 14:20:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:14,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,842 INFO L225 Difference]: With dead ends: 95 [2018-10-04 14:20:14,842 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 14:20:14,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 14:20:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 14:20:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-04 14:20:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 14:20:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-04 14:20:14,860 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-04 14:20:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:14,861 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-04 14:20:14,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-04 14:20:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:14,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:14,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:14,863 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:14,863 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-04 14:20:14,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:14,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:14,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:14,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:15,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:15,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 14:20:15,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:15,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:15,291 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-04 14:20:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:17,443 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-04 14:20:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:17,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 14:20:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:17,452 INFO L225 Difference]: With dead ends: 150 [2018-10-04 14:20:17,453 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 14:20:17,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 26 [2018-10-04 14:20:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 14:20:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-04 14:20:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 14:20:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-04 14:20:17,477 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-04 14:20:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:17,477 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-04 14:20:17,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-04 14:20:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:17,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:17,479 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:17,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:17,479 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-04 14:20:17,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:17,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:17,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:17,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:17,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:17,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:17,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-04 14:20:17,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:17,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:17,707 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-04 14:20:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:18,812 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-04 14:20:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:20:18,812 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 14:20:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:18,814 INFO L225 Difference]: With dead ends: 137 [2018-10-04 14:20:18,814 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:20:18,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 15 [2018-10-04 14:20:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:20:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-04 14:20:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 14:20:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-04 14:20:18,845 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-04 14:20:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:18,846 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-04 14:20:18,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-04 14:20:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:18,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:18,847 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:18,853 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:18,854 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-04 14:20:18,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:18,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:18,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:18,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:18,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:19,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:19,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:19,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:19,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:19,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-10-04 14:20:19,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:19,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:19,182 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-10-04 14:20:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:21,452 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-04 14:20:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:21,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 14:20:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:21,454 INFO L225 Difference]: With dead ends: 211 [2018-10-04 14:20:21,454 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 14:20:21,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 15 [2018-10-04 14:20:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 14:20:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-04 14:20:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 14:20:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-04 14:20:21,493 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-04 14:20:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:21,493 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-04 14:20:21,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-04 14:20:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:21,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:21,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:21,494 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:21,495 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-04 14:20:21,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:21,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:21,583 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:21,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:21,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:21,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:21,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:21,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:21,665 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-10-04 14:20:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:22,334 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-04 14:20:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:22,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-10-04 14:20:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:22,337 INFO L225 Difference]: With dead ends: 246 [2018-10-04 14:20:22,337 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 14:20:22,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 14:20:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 14:20:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-04 14:20:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 14:20:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-04 14:20:22,374 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-04 14:20:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:22,375 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-04 14:20:22,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-04 14:20:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:22,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:22,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:22,376 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:22,377 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-04 14:20:22,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:22,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:22,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:22,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:22,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:20:22,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:22,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:22,525 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-04 14:20:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:22,882 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-04 14:20:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:22,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:22,884 INFO L225 Difference]: With dead ends: 252 [2018-10-04 14:20:22,884 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 14:20:22,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 14:20:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 14:20:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-04 14:20:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 14:20:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-04 14:20:22,922 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-04 14:20:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:22,922 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-04 14:20:22,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-04 14:20:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:22,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:22,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:22,924 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:22,924 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-04 14:20:22,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:22,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:22,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:22,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:23,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:23,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:23,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:23,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 14:20:23,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:23,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:23,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:23,137 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-04 14:20:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:23,729 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-04 14:20:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:20:23,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-04 14:20:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:23,732 INFO L225 Difference]: With dead ends: 260 [2018-10-04 14:20:23,732 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 14:20:23,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 14:20:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 14:20:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-04 14:20:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-04 14:20:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-04 14:20:23,768 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-04 14:20:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:23,769 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-04 14:20:23,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-04 14:20:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:23,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:23,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:23,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:23,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-04 14:20:23,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:23,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:23,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:23,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:23,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:23,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:23,842 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-04 14:20:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:24,445 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-04 14:20:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:24,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:24,451 INFO L225 Difference]: With dead ends: 316 [2018-10-04 14:20:24,451 INFO L226 Difference]: Without dead ends: 314 [2018-10-04 14:20:24,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:20:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-04 14:20:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-04 14:20:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 14:20:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-04 14:20:24,493 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-04 14:20:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:24,493 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-04 14:20:24,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-04 14:20:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:24,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:24,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:24,494 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:24,494 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-04 14:20:24,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:24,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:24,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:24,558 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:24,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:24,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:20:24,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:24,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:24,636 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-04 14:20:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:24,983 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-04 14:20:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:24,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:24,992 INFO L225 Difference]: With dead ends: 428 [2018-10-04 14:20:24,992 INFO L226 Difference]: Without dead ends: 426 [2018-10-04 14:20:24,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 14:20:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-04 14:20:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-04 14:20:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-04 14:20:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-04 14:20:25,067 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-04 14:20:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:25,067 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-04 14:20:25,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-04 14:20:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:25,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:25,069 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:25,069 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:25,069 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-04 14:20:25,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:25,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:25,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:25,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:25,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:25,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:25,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 14:20:25,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:25,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:25,333 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-04 14:20:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,588 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-04 14:20:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:26,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 14:20:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,591 INFO L225 Difference]: With dead ends: 466 [2018-10-04 14:20:26,591 INFO L226 Difference]: Without dead ends: 464 [2018-10-04 14:20:26,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 13 [2018-10-04 14:20:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-04 14:20:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-04 14:20:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 14:20:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-04 14:20:26,680 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-04 14:20:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,681 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-04 14:20:26,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-04 14:20:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:26,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,682 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:26,682 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,682 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-04 14:20:26,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:27,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:27,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-04 14:20:27,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:27,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:27,298 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-04 14:20:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:29,183 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-04 14:20:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:20:29,184 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-04 14:20:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:29,187 INFO L225 Difference]: With dead ends: 859 [2018-10-04 14:20:29,187 INFO L226 Difference]: Without dead ends: 509 [2018-10-04 14:20:29,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 19 [2018-10-04 14:20:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-04 14:20:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-04 14:20:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-04 14:20:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-04 14:20:29,263 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-04 14:20:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:29,264 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-04 14:20:29,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-04 14:20:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:29,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:29,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:29,265 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:29,265 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-04 14:20:29,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:29,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:29,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:29,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:29,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:29,379 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-04 14:20:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:29,920 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-04 14:20:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:29,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 14:20:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:29,923 INFO L225 Difference]: With dead ends: 481 [2018-10-04 14:20:29,923 INFO L226 Difference]: Without dead ends: 479 [2018-10-04 14:20:29,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 14:20:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-04 14:20:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-04 14:20:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 14:20:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-04 14:20:29,999 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-04 14:20:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:29,999 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-04 14:20:29,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-04 14:20:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:30,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,000 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:30,001 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-04 14:20:30,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:30,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:30,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:30,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 14:20:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:30,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:30,248 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-04 14:20:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:31,276 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-10-04 14:20:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:31,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 14:20:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:31,279 INFO L225 Difference]: With dead ends: 952 [2018-10-04 14:20:31,280 INFO L226 Difference]: Without dead ends: 559 [2018-10-04 14:20:31,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 24 [2018-10-04 14:20:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-04 14:20:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-10-04 14:20:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-04 14:20:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-10-04 14:20:31,396 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-10-04 14:20:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:31,396 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-10-04 14:20:31,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-10-04 14:20:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:31,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:31,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:31,398 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:31,398 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-10-04 14:20:31,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:31,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:31,501 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-10-04 14:20:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:31,837 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-10-04 14:20:31,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:31,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 14:20:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:31,841 INFO L225 Difference]: With dead ends: 524 [2018-10-04 14:20:31,841 INFO L226 Difference]: Without dead ends: 522 [2018-10-04 14:20:31,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 14:20:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-04 14:20:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-10-04 14:20:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-04 14:20:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-10-04 14:20:31,964 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-10-04 14:20:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:31,964 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-10-04 14:20:31,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-10-04 14:20:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:31,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:31,966 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:31,966 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-10-04 14:20:31,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:32,549 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:33,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:33,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-04 14:20:33,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:33,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:33,141 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:33,141 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-10-04 14:20:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:33,821 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-10-04 14:20:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:33,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-04 14:20:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:33,826 INFO L225 Difference]: With dead ends: 556 [2018-10-04 14:20:33,826 INFO L226 Difference]: Without dead ends: 554 [2018-10-04 14:20:33,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 11 [2018-10-04 14:20:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-04 14:20:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-10-04 14:20:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-04 14:20:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-10-04 14:20:33,927 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-10-04 14:20:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:33,927 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-10-04 14:20:33,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-10-04 14:20:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:33,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:33,928 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:33,928 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:33,929 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-10-04 14:20:33,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:33,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:34,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:34,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:34,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-10-04 14:20:34,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:34,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:34,112 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-10-04 14:20:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:35,273 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-10-04 14:20:35,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:35,278 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 14:20:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:35,281 INFO L225 Difference]: With dead ends: 631 [2018-10-04 14:20:35,281 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 14:20:35,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 20 [2018-10-04 14:20:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 14:20:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-10-04 14:20:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-04 14:20:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-10-04 14:20:35,380 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-10-04 14:20:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:35,380 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-10-04 14:20:35,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-10-04 14:20:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:35,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:35,381 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:35,381 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:35,381 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-10-04 14:20:35,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:35,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:35,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:35,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:35,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:35,496 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:35,496 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:35,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:35,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:35,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:35,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:35,546 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-10-04 14:20:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:35,947 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-10-04 14:20:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:35,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:20:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:35,950 INFO L225 Difference]: With dead ends: 601 [2018-10-04 14:20:35,950 INFO L226 Difference]: Without dead ends: 599 [2018-10-04 14:20:35,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:20:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-04 14:20:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-10-04 14:20:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-04 14:20:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-10-04 14:20:36,073 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-10-04 14:20:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:36,074 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-10-04 14:20:36,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-10-04 14:20:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:36,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:36,075 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:36,075 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:36,075 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-10-04 14:20:36,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:36,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:36,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:36,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:36,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:36,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:36,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:36,252 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-10-04 14:20:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:36,797 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-10-04 14:20:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:20:36,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:20:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:36,800 INFO L225 Difference]: With dead ends: 624 [2018-10-04 14:20:36,800 INFO L226 Difference]: Without dead ends: 622 [2018-10-04 14:20:36,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:20:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-04 14:20:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-10-04 14:20:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-10-04 14:20:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-10-04 14:20:36,918 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-10-04 14:20:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:36,918 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-10-04 14:20:36,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-10-04 14:20:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:36,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:36,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:36,919 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:36,920 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-10-04 14:20:36,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:36,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:36,986 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:37,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:37,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:37,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:37,059 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-10-04 14:20:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:37,408 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-10-04 14:20:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:20:37,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:20:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:37,410 INFO L225 Difference]: With dead ends: 584 [2018-10-04 14:20:37,411 INFO L226 Difference]: Without dead ends: 582 [2018-10-04 14:20:37,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:20:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-04 14:20:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-10-04 14:20:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-04 14:20:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-10-04 14:20:37,510 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-10-04 14:20:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:37,510 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-10-04 14:20:37,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-10-04 14:20:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:37,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:37,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:37,511 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:37,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-10-04 14:20:37,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:37,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:37,602 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:37,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:37,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:37,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:37,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:37,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:37,668 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-10-04 14:20:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,106 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-10-04 14:20:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:38,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:20:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,109 INFO L225 Difference]: With dead ends: 618 [2018-10-04 14:20:38,109 INFO L226 Difference]: Without dead ends: 616 [2018-10-04 14:20:38,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:20:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-04 14:20:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-10-04 14:20:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-04 14:20:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-10-04 14:20:38,215 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-10-04 14:20:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:38,215 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-10-04 14:20:38,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-10-04 14:20:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:38,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:38,216 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:38,217 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:38,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-10-04 14:20:38,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:38,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:38,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:38,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:20:38,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:38,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:38,355 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-10-04 14:20:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,762 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-10-04 14:20:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:38,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 14:20:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,764 INFO L225 Difference]: With dead ends: 613 [2018-10-04 14:20:38,764 INFO L226 Difference]: Without dead ends: 611 [2018-10-04 14:20:38,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 14:20:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-04 14:20:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-10-04 14:20:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-04 14:20:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-10-04 14:20:38,867 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-10-04 14:20:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:38,867 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-10-04 14:20:38,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-10-04 14:20:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:38,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:38,868 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:38,868 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:38,869 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-10-04 14:20:38,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:38,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:38,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:39,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:39,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:39,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-04 14:20:39,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:39,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:39,134 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 14 states. [2018-10-04 14:20:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:40,472 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-10-04 14:20:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:40,480 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-10-04 14:20:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:40,484 INFO L225 Difference]: With dead ends: 875 [2018-10-04 14:20:40,484 INFO L226 Difference]: Without dead ends: 873 [2018-10-04 14:20:40,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 28 [2018-10-04 14:20:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-10-04 14:20:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-10-04 14:20:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-04 14:20:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-10-04 14:20:40,655 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-10-04 14:20:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:40,656 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-10-04 14:20:40,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-10-04 14:20:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:40,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:40,656 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:40,657 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:40,657 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-10-04 14:20:40,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:40,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:40,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:40,740 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:40,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:40,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-10-04 14:20:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:40,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:40,828 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-10-04 14:20:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:42,113 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-10-04 14:20:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:20:42,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 14:20:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:42,118 INFO L225 Difference]: With dead ends: 1281 [2018-10-04 14:20:42,118 INFO L226 Difference]: Without dead ends: 1279 [2018-10-04 14:20:42,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-04 14:20:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-04 14:20:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-10-04 14:20:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-04 14:20:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-04 14:20:42,312 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-10-04 14:20:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:42,313 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-04 14:20:42,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-04 14:20:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:42,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:42,314 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:42,314 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:42,314 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-10-04 14:20:42,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:42,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:42,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:42,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:42,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:42,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:42,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:42,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:42,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:42,514 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-10-04 14:20:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:43,241 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-10-04 14:20:43,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:43,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-04 14:20:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:43,245 INFO L225 Difference]: With dead ends: 1054 [2018-10-04 14:20:43,245 INFO L226 Difference]: Without dead ends: 1052 [2018-10-04 14:20:43,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 14:20:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-04 14:20:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-10-04 14:20:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 14:20:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-10-04 14:20:43,445 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-10-04 14:20:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:43,445 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-10-04 14:20:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-10-04 14:20:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:43,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:43,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:43,447 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:43,447 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-10-04 14:20:43,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:43,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:43,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:43,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:43,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:43,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-04 14:20:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:43,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:43,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,820 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 14 states. [2018-10-04 14:20:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:45,332 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-10-04 14:20:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:45,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:45,336 INFO L225 Difference]: With dead ends: 1125 [2018-10-04 14:20:45,336 INFO L226 Difference]: Without dead ends: 1123 [2018-10-04 14:20:45,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 29 [2018-10-04 14:20:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-04 14:20:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-10-04 14:20:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-04 14:20:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-04 14:20:45,532 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-10-04 14:20:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:45,532 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-04 14:20:45,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-04 14:20:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:45,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:45,533 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:45,533 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:45,533 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-10-04 14:20:45,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:45,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:45,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:45,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:45,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-04 14:20:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:45,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:45,798 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-10-04 14:20:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:47,117 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-10-04 14:20:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:47,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:20:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:47,121 INFO L225 Difference]: With dead ends: 1125 [2018-10-04 14:20:47,121 INFO L226 Difference]: Without dead ends: 1123 [2018-10-04 14:20:47,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 22 [2018-10-04 14:20:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-04 14:20:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-10-04 14:20:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-04 14:20:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-10-04 14:20:47,316 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-10-04 14:20:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:47,316 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-10-04 14:20:47,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-10-04 14:20:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:47,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:47,317 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:47,317 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:47,318 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-10-04 14:20:47,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:47,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:47,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:47,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-04 14:20:47,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:20:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:20:47,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:47,508 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-10-04 14:20:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:48,386 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-10-04 14:20:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:20:48,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-04 14:20:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:48,391 INFO L225 Difference]: With dead ends: 1117 [2018-10-04 14:20:48,391 INFO L226 Difference]: Without dead ends: 1115 [2018-10-04 14:20:48,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 14:20:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-10-04 14:20:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-10-04 14:20:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-04 14:20:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-10-04 14:20:48,583 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-10-04 14:20:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:48,584 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-10-04 14:20:48,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:20:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-10-04 14:20:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:20:48,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:48,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:48,585 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:48,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-10-04 14:20:48,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:48,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:49,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:49,273 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:49,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:49,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:49,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:49,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:49,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:49,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:49,514 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-10-04 14:20:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:50,312 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-10-04 14:20:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:50,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-04 14:20:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:50,316 INFO L225 Difference]: With dead ends: 995 [2018-10-04 14:20:50,316 INFO L226 Difference]: Without dead ends: 993 [2018-10-04 14:20:50,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 12 [2018-10-04 14:20:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-04 14:20:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-10-04 14:20:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-10-04 14:20:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-10-04 14:20:50,519 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-10-04 14:20:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:50,519 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-10-04 14:20:50,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-10-04 14:20:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:50,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:50,521 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:20:50,521 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:50,521 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-10-04 14:20:50,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:50,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:50,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 14:20:50,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:50,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 14:20:50,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:20:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:20:50,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:50,798 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-10-04 14:20:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:52,876 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-10-04 14:20:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:20:52,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-04 14:20:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:52,881 INFO L225 Difference]: With dead ends: 2105 [2018-10-04 14:20:52,881 INFO L226 Difference]: Without dead ends: 1229 [2018-10-04 14:20:52,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 29 [2018-10-04 14:20:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-04 14:20:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-10-04 14:20:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-04 14:20:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-10-04 14:20:53,127 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-10-04 14:20:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:53,128 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-10-04 14:20:53,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:20:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-10-04 14:20:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:53,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:53,129 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:53,129 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:53,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-10-04 14:20:53,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:53,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:53,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:53,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:53,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:53,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:53,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:53,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:53,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:20:53,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:53,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:53,359 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-10-04 14:20:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:55,240 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-10-04 14:20:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:20:55,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:20:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:55,244 INFO L225 Difference]: With dead ends: 2110 [2018-10-04 14:20:55,244 INFO L226 Difference]: Without dead ends: 1097 [2018-10-04 14:20:55,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 29 [2018-10-04 14:20:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-04 14:20:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-10-04 14:20:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-04 14:20:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-10-04 14:20:55,483 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-10-04 14:20:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:55,483 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-10-04 14:20:55,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:20:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-10-04 14:20:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:55,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:55,484 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:55,484 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:55,484 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-10-04 14:20:55,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:55,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:55,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:55,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:20:55,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:55,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:55,700 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-10-04 14:20:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:58,426 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-10-04 14:20:58,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:20:58,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:20:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:58,432 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 14:20:58,432 INFO L226 Difference]: Without dead ends: 1867 [2018-10-04 14:20:58,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 30 [2018-10-04 14:20:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-10-04 14:20:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-10-04 14:20:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-04 14:20:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-10-04 14:20:58,853 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-10-04 14:20:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:58,854 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-10-04 14:20:58,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:20:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-10-04 14:20:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:58,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:58,855 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:58,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:58,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-10-04 14:20:58,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:58,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:58,944 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:20:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:20:59,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:59,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:59,049 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-10-04 14:21:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:02,706 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-10-04 14:21:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:21:02,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:21:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:02,735 INFO L225 Difference]: With dead ends: 4461 [2018-10-04 14:21:02,735 INFO L226 Difference]: Without dead ends: 2887 [2018-10-04 14:21:02,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 23 [2018-10-04 14:21:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-04 14:21:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-10-04 14:21:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-10-04 14:21:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-10-04 14:21:03,799 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-10-04 14:21:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:03,799 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-10-04 14:21:03,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-10-04 14:21:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:21:03,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:03,801 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:21:03,801 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:03,801 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:03,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-10-04 14:21:03,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:04,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:04,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:04,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:04,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:06,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 14:21:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:06,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:06,050 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-10-04 14:21:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:10,130 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-10-04 14:21:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 14:21:10,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 14:21:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:10,138 INFO L225 Difference]: With dead ends: 3903 [2018-10-04 14:21:10,138 INFO L226 Difference]: Without dead ends: 3227 [2018-10-04 14:21:10,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 3.3s impTime 37 [2018-10-04 14:21:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-10-04 14:21:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-10-04 14:21:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-10-04 14:21:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-10-04 14:21:10,837 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-10-04 14:21:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:10,837 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-10-04 14:21:10,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-10-04 14:21:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:21:10,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:10,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:10,839 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:10,839 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-10-04 14:21:10,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:10,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:11,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:11,750 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:11,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:11,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:11,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:11,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 14:21:11,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:11,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:11,919 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-10-04 14:21:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:14,341 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-10-04 14:21:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:21:14,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:21:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:14,347 INFO L225 Difference]: With dead ends: 5427 [2018-10-04 14:21:14,347 INFO L226 Difference]: Without dead ends: 2851 [2018-10-04 14:21:14,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 25 [2018-10-04 14:21:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-10-04 14:21:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-10-04 14:21:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-10-04 14:21:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-10-04 14:21:15,079 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-10-04 14:21:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:15,080 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-10-04 14:21:15,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-10-04 14:21:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:21:15,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:15,081 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:21:15,081 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:15,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-10-04 14:21:15,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:15,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:15,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:15,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:15,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:15,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:15,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:21:15,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:15,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:15,346 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-10-04 14:21:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:18,131 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-10-04 14:21:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:21:18,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:21:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:18,137 INFO L225 Difference]: With dead ends: 5837 [2018-10-04 14:21:18,138 INFO L226 Difference]: Without dead ends: 3072 [2018-10-04 14:21:18,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 28 [2018-10-04 14:21:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-04 14:21:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-10-04 14:21:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-10-04 14:21:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-10-04 14:21:18,901 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-10-04 14:21:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:18,902 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-10-04 14:21:18,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-10-04 14:21:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:18,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:18,903 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:21:18,903 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:18,904 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-10-04 14:21:18,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:18,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:19,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:19,018 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:19,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:19,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:19,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 14:21:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:21:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:21:19,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:19,228 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-10-04 14:21:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:24,861 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-10-04 14:21:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 14:21:24,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-10-04 14:21:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:24,867 INFO L225 Difference]: With dead ends: 5120 [2018-10-04 14:21:24,867 INFO L226 Difference]: Without dead ends: 3342 [2018-10-04 14:21:24,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.1s impTime 59 [2018-10-04 14:21:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-10-04 14:21:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-10-04 14:21:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-10-04 14:21:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-10-04 14:21:25,790 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-10-04 14:21:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:25,790 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-10-04 14:21:25,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:21:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-10-04 14:21:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:25,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:25,792 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:25,792 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:25,792 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-10-04 14:21:25,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:25,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:25,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:25,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:25,975 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:25,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:26,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:26,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 14:21:26,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:26,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:26,114 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 18 states. [2018-10-04 14:21:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:29,435 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-10-04 14:21:29,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:21:29,435 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:21:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:29,440 INFO L225 Difference]: With dead ends: 3487 [2018-10-04 14:21:29,440 INFO L226 Difference]: Without dead ends: 3485 [2018-10-04 14:21:29,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 38 [2018-10-04 14:21:29,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-10-04 14:21:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-10-04 14:21:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-04 14:21:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-10-04 14:21:30,227 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-10-04 14:21:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:30,228 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-10-04 14:21:30,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-10-04 14:21:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:30,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:30,229 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:30,229 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:30,229 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-10-04 14:21:30,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:30,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:30,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:30,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:30,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:30,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:30,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 14:21:30,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:30,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:30,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:30,650 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 18 states. [2018-10-04 14:21:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:34,570 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-10-04 14:21:34,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:21:34,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:21:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:34,574 INFO L225 Difference]: With dead ends: 3557 [2018-10-04 14:21:34,574 INFO L226 Difference]: Without dead ends: 3555 [2018-10-04 14:21:34,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 59 [2018-10-04 14:21:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-10-04 14:21:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-10-04 14:21:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-10-04 14:21:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-10-04 14:21:35,415 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-10-04 14:21:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:35,415 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-10-04 14:21:35,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-10-04 14:21:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:35,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:35,417 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:35,417 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:35,417 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:35,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-10-04 14:21:35,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:35,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:35,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:35,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:35,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:35,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:35,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:35,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:35,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 14:21:35,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:35,721 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:35,721 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-10-04 14:21:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:43,111 INFO L93 Difference]: Finished difference Result 5268 states and 8851 transitions. [2018-10-04 14:21:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-04 14:21:43,112 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:21:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:43,117 INFO L225 Difference]: With dead ends: 5268 [2018-10-04 14:21:43,117 INFO L226 Difference]: Without dead ends: 5266 [2018-10-04 14:21:43,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.6s impTime 95 [2018-10-04 14:21:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-10-04 14:21:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 3515. [2018-10-04 14:21:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-04 14:21:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-10-04 14:21:44,003 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-10-04 14:21:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:44,003 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-10-04 14:21:44,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-10-04 14:21:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:44,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:44,005 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:44,005 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:44,005 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-10-04 14:21:44,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:44,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:44,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:44,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:44,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:44,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:44,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-04 14:21:44,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:44,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:44,268 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-10-04 14:21:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:50,695 INFO L93 Difference]: Finished difference Result 4859 states and 8135 transitions. [2018-10-04 14:21:50,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-04 14:21:50,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:21:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:50,700 INFO L225 Difference]: With dead ends: 4859 [2018-10-04 14:21:50,700 INFO L226 Difference]: Without dead ends: 4857 [2018-10-04 14:21:50,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.1s impTime 84 [2018-10-04 14:21:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2018-10-04 14:21:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3405. [2018-10-04 14:21:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-04 14:21:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-10-04 14:21:51,648 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-10-04 14:21:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:51,648 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-10-04 14:21:51,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-10-04 14:21:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:51,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:51,649 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:51,649 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:51,650 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-10-04 14:21:51,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:51,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:51,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:51,778 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:51,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:51,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:51,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:21:51,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:51,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 14:21:51,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:51,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:51,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:51,899 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-10-04 14:21:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:54,509 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-10-04 14:21:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:21:54,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 14:21:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:54,512 INFO L225 Difference]: With dead ends: 5774 [2018-10-04 14:21:54,512 INFO L226 Difference]: Without dead ends: 3100 [2018-10-04 14:21:54,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 26 [2018-10-04 14:21:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-04 14:21:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-10-04 14:21:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-10-04 14:21:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-10-04 14:21:55,278 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-10-04 14:21:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:55,279 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-10-04 14:21:55,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-10-04 14:21:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:55,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:55,280 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:55,280 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:55,280 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-10-04 14:21:55,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:55,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:55,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:55,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:55,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:55,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:55,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:55,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:55,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:55,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:55,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 14:21:55,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:55,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:55,503 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 18 states. [2018-10-04 14:21:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:58,251 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-10-04 14:21:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:21:58,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:21:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:58,256 INFO L225 Difference]: With dead ends: 3114 [2018-10-04 14:21:58,256 INFO L226 Difference]: Without dead ends: 3112 [2018-10-04 14:21:58,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 32 [2018-10-04 14:21:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-10-04 14:21:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-10-04 14:21:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-10-04 14:21:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-10-04 14:21:59,773 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-10-04 14:21:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:59,773 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-10-04 14:21:59,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-10-04 14:21:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:59,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:59,775 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:59,775 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:59,775 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-10-04 14:21:59,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:00,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:00,725 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:00,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:00,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:00,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:00,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:01,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:01,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-04 14:22:01,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:01,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:01,668 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-10-04 14:22:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:06,961 INFO L93 Difference]: Finished difference Result 4419 states and 7414 transitions. [2018-10-04 14:22:06,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 14:22:06,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 14:22:06,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:06,966 INFO L225 Difference]: With dead ends: 4419 [2018-10-04 14:22:06,966 INFO L226 Difference]: Without dead ends: 4417 [2018-10-04 14:22:06,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.4s impTime 65 [2018-10-04 14:22:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2018-10-04 14:22:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 3073. [2018-10-04 14:22:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-10-04 14:22:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-10-04 14:22:07,977 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-10-04 14:22:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:07,978 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-10-04 14:22:07,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:22:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-10-04 14:22:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:22:07,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:07,979 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:07,979 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:07,979 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-10-04 14:22:07,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:07,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:07,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:08,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:08,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:08,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:09,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 14:22:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:22:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:22:09,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:09,015 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 18 states. [2018-10-04 14:22:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:14,275 INFO L93 Difference]: Finished difference Result 4437 states and 7426 transitions. [2018-10-04 14:22:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:22:14,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:22:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:14,280 INFO L225 Difference]: With dead ends: 4437 [2018-10-04 14:22:14,280 INFO L226 Difference]: Without dead ends: 4435 [2018-10-04 14:22:14,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.5s impTime 59 [2018-10-04 14:22:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-10-04 14:22:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 2723. [2018-10-04 14:22:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-04 14:22:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-10-04 14:22:15,109 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-10-04 14:22:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:15,109 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-10-04 14:22:15,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-10-04 14:22:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:22:15,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:15,111 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:15,111 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:15,111 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-10-04 14:22:15,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:15,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:15,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:15,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:15,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-04 14:22:15,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:15,425 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:15,425 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 19 states. [2018-10-04 14:22:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:20,303 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-10-04 14:22:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 14:22:20,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 14:22:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:20,308 INFO L225 Difference]: With dead ends: 4290 [2018-10-04 14:22:20,308 INFO L226 Difference]: Without dead ends: 4288 [2018-10-04 14:22:20,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 65 [2018-10-04 14:22:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-10-04 14:22:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-10-04 14:22:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-10-04 14:22:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-10-04 14:22:21,497 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-10-04 14:22:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:21,497 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-10-04 14:22:21,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:22:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-10-04 14:22:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:22:21,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:21,498 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:21,499 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:21,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:21,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-10-04 14:22:21,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:21,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:21,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:21,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:21,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:21,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:21,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:21,636 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:22:21,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:21,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:21,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:21,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-04 14:22:21,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:21,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:21,935 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 19 states. [2018-10-04 14:22:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:22:24,080 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.internImplication(ImplicationMap.java:190) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.unifyPredicate(ImplicationMap.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:234) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:301) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-04 14:22:24,084 INFO L168 Benchmark]: Toolchain (without parser) took 134694.43 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2018-10-04 14:22:24,086 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:22:24,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:22:24,087 INFO L168 Benchmark]: Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:22:24,088 INFO L168 Benchmark]: RCFGBuilder took 464.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:22:24,088 INFO L168 Benchmark]: TraceAbstraction took 134159.58 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2018-10-04 14:22:24,092 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 464.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134159.58 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.internImplication(ImplicationMap.java:190) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-22-24-103.csv Received shutdown request...