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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:40:27,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:27,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:27,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:27,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:27,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:27,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:27,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:27,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:27,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:27,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:27,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:27,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:27,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:27,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:27,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:27,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:27,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:27,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:27,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:27,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:27,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:27,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:27,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:27,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:27,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:27,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:27,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:27,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:27,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:27,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:27,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:27,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:27,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:27,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:27,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:27,980 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:40:27,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:27,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:27,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:27,998 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:27,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:28,001 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:28,002 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:28,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:28,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:28,002 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:28,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:28,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:28,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:28,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:28,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:28,004 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:28,004 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:28,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:28,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:28,005 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:28,005 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:28,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:28,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:28,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:28,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:28,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:28,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:28,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:28,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:28,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:28,008 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:28,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:28,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:28,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:28,090 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:28,090 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:28,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-09-26 21:40:28,091 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-09-26 21:40:28,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:28,171 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:28,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:28,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:28,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:28,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,218 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:28,219 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:28,219 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:28,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:28,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:28,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:28,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:28,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... [2018-09-26 21:40:28,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:28,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:28,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:28,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:28,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:28,309 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:40:28,309 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:40:28,309 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:40:28,809 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:28,810 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:28 BoogieIcfgContainer [2018-09-26 21:40:28,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:28,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:28,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:28,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:28,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:28" (1/2) ... [2018-09-26 21:40:28,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386cf662 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:28, skipping insertion in model container [2018-09-26 21:40:28,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:28" (2/2) ... [2018-09-26 21:40:28,819 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-09-26 21:40:28,829 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:28,845 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 21:40:28,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:28,910 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:28,910 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:28,910 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:28,910 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:28,910 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:28,910 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:28,911 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:28,911 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:40:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:28,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:28,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:28,956 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:28,965 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-09-26 21:40:28,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:29,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:29,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:29,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:29,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:29,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:29,245 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-09-26 21:40:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:31,033 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-09-26 21:40:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:31,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:40:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:31,051 INFO L225 Difference]: With dead ends: 49 [2018-09-26 21:40:31,051 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 21:40:31,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 21:40:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-09-26 21:40:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:40:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-09-26 21:40:31,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-09-26 21:40:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:31,099 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-09-26 21:40:31,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-09-26 21:40:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:31,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:31,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:31,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:31,102 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-09-26 21:40:31,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:31,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:31,215 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:31,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:31,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:31,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:31,218 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-09-26 21:40:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:31,893 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-09-26 21:40:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:31,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:40:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:31,896 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:40:31,896 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 21:40:31,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 21:40:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-09-26 21:40:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 21:40:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-09-26 21:40:31,907 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-09-26 21:40:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:31,907 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-09-26 21:40:31,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-09-26 21:40:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:31,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:31,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:31,909 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:31,909 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-09-26 21:40:31,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:31,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:32,049 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:32,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:40:32,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:40:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:40:32,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:32,050 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-09-26 21:40:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:33,648 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-09-26 21:40:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:40:33,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 21:40:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:33,652 INFO L225 Difference]: With dead ends: 84 [2018-09-26 21:40:33,652 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 21:40:33,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 21:40:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-09-26 21:40:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:40:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-09-26 21:40:33,666 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-09-26 21:40:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:33,666 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-09-26 21:40:33,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:40:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-09-26 21:40:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:33,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:33,668 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 21:40:33,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:33,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-09-26 21:40:33,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:33,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:33,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:33,808 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:33,809 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:33,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:33,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:40:33,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-09-26 21:40:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:40:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:40:33,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:33,943 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-09-26 21:40:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:37,157 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-09-26 21:40:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:40:37,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-09-26 21:40:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:37,161 INFO L225 Difference]: With dead ends: 142 [2018-09-26 21:40:37,161 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 21:40:37,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 21:40:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-09-26 21:40:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 21:40:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-09-26 21:40:37,179 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-09-26 21:40:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:37,179 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-09-26 21:40:37,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:40:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-09-26 21:40:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:40:37,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:37,180 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:37,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:37,181 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-09-26 21:40:37,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:37,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:37,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:37,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:37,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:37,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:37,386 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:40:37,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-09-26 21:40:37,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:40:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:40:37,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:37,387 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-09-26 21:40:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:40,983 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-09-26 21:40:40,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:40:40,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-09-26 21:40:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:40,986 INFO L225 Difference]: With dead ends: 148 [2018-09-26 21:40:40,986 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 21:40:40,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 21:40:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-09-26 21:40:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 21:40:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-09-26 21:40:41,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-09-26 21:40:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:41,005 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-09-26 21:40:41,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:40:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-09-26 21:40:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:41,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:41,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:41,007 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:41,007 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-09-26 21:40:41,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:41,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:41,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:41,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:41,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:41,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:41,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:41,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:41,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:41,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:40:41,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:41,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:41,289 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-09-26 21:40:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:43,615 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-09-26 21:40:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:40:43,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:40:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:43,617 INFO L225 Difference]: With dead ends: 124 [2018-09-26 21:40:43,617 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 21:40:43,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 21:40:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-09-26 21:40:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 21:40:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-09-26 21:40:43,639 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-09-26 21:40:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:43,640 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-09-26 21:40:43,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:40:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-09-26 21:40:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:43,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:43,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:43,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:43,642 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-09-26 21:40:43,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:43,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:43,732 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:43,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:40:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:43,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:43,733 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-09-26 21:40:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:45,126 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-09-26 21:40:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:40:45,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 21:40:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:45,127 INFO L225 Difference]: With dead ends: 132 [2018-09-26 21:40:45,127 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 21:40:45,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 21:40:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-09-26 21:40:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 21:40:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-09-26 21:40:45,148 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-09-26 21:40:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:45,149 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-09-26 21:40:45,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-09-26 21:40:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:45,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:45,150 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:45,150 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:45,151 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-09-26 21:40:45,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:45,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:45,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:45,243 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:45,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:45,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:45,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:45,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:40:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:45,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:45,770 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-09-26 21:40:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:49,457 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-09-26 21:40:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:40:49,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:40:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:49,459 INFO L225 Difference]: With dead ends: 162 [2018-09-26 21:40:49,459 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 21:40:49,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 21:40:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-09-26 21:40:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 21:40:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-09-26 21:40:49,484 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-09-26 21:40:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:49,484 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-09-26 21:40:49,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:40:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-09-26 21:40:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:49,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:49,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:49,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:49,486 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-09-26 21:40:49,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:49,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:49,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:49,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:49,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:49,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:50,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:50,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-26 21:40:50,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:40:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:40:50,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:50,162 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-09-26 21:40:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:54,850 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-09-26 21:40:54,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:40:54,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-26 21:40:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:54,852 INFO L225 Difference]: With dead ends: 223 [2018-09-26 21:40:54,852 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 21:40:54,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 21:40:54,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-09-26 21:40:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 21:40:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-09-26 21:40:54,880 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-09-26 21:40:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:54,881 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-09-26 21:40:54,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:40:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-09-26 21:40:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:54,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:54,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:54,882 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:54,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-09-26 21:40:54,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:54,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:54,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:54,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:55,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:55,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-09-26 21:40:55,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:55,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:40:55,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:55,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:55,133 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-09-26 21:40:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:57,811 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-09-26 21:40:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:40:57,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:40:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:57,813 INFO L225 Difference]: With dead ends: 222 [2018-09-26 21:40:57,813 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 21:40:57,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 21:40:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-09-26 21:40:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 21:40:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-09-26 21:40:57,841 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-09-26 21:40:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:57,841 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-09-26 21:40:57,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:40:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-09-26 21:40:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:57,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:57,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:57,843 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:57,843 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-09-26 21:40:57,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:57,932 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:57,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:40:57,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:57,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:57,934 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-09-26 21:40:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:58,991 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-09-26 21:40:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:40:58,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 21:40:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:58,993 INFO L225 Difference]: With dead ends: 203 [2018-09-26 21:40:58,993 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 21:40:58,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 21:40:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-09-26 21:40:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 21:40:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-09-26 21:40:59,015 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-09-26 21:40:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:59,015 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-09-26 21:40:59,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-09-26 21:40:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:40:59,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:59,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:59,017 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:59,017 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-09-26 21:40:59,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:59,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:59,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:59,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:59,305 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:59,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:59,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:59,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:59,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:40:59,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:59,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:59,426 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-09-26 21:41:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:01,770 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-09-26 21:41:01,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:41:01,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:41:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:01,772 INFO L225 Difference]: With dead ends: 241 [2018-09-26 21:41:01,772 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 21:41:01,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 21:41:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-09-26 21:41:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 21:41:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-09-26 21:41:01,807 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-09-26 21:41:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:01,807 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-09-26 21:41:01,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-09-26 21:41:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:41:01,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:01,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:01,809 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:01,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-09-26 21:41:01,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:01,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:01,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:01,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:01,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:01,913 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:01,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:01,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:01,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:01,914 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-09-26 21:41:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:03,061 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-09-26 21:41:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:41:03,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 21:41:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:03,063 INFO L225 Difference]: With dead ends: 220 [2018-09-26 21:41:03,063 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 21:41:03,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 21:41:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-09-26 21:41:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 21:41:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-09-26 21:41:03,087 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-09-26 21:41:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:03,087 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-09-26 21:41:03,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-09-26 21:41:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:41:03,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:03,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:03,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:03,089 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-09-26 21:41:03,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:03,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:03,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:03,160 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:03,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:03,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:03,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:03,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:03,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-26 21:41:03,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:03,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:03,344 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-09-26 21:41:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:08,161 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-09-26 21:41:08,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:41:08,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-26 21:41:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:08,164 INFO L225 Difference]: With dead ends: 320 [2018-09-26 21:41:08,164 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 21:41:08,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 21:41:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-09-26 21:41:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 21:41:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-09-26 21:41:08,199 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-09-26 21:41:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:08,200 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-09-26 21:41:08,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-09-26 21:41:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:41:08,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:08,201 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:08,201 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:08,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-09-26 21:41:08,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:08,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:08,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:08,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:08,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:08,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:08,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:41:08,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:08,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:08,427 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-09-26 21:41:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:10,408 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-09-26 21:41:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:10,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:41:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:10,409 INFO L225 Difference]: With dead ends: 304 [2018-09-26 21:41:10,409 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 21:41:10,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 21:41:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-09-26 21:41:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-26 21:41:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-09-26 21:41:10,454 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-09-26 21:41:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:10,454 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-09-26 21:41:10,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-09-26 21:41:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:41:10,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:10,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:10,456 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:10,456 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-09-26 21:41:10,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:10,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:10,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:10,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:10,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:10,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:10,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:10,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:10,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:10,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-26 21:41:10,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:10,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:10,734 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-09-26 21:41:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:12,781 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-09-26 21:41:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:41:12,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-26 21:41:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:12,783 INFO L225 Difference]: With dead ends: 281 [2018-09-26 21:41:12,783 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 21:41:12,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 21:41:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-09-26 21:41:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-26 21:41:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-09-26 21:41:12,831 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-09-26 21:41:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-09-26 21:41:12,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-09-26 21:41:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:41:12,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:12,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:12,833 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:12,833 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-09-26 21:41:12,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:12,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:13,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:13,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:13,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:13,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:13,261 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-09-26 21:41:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:14,642 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-09-26 21:41:14,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:41:14,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 21:41:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:14,645 INFO L225 Difference]: With dead ends: 286 [2018-09-26 21:41:14,645 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 21:41:14,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 21:41:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-09-26 21:41:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 21:41:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-09-26 21:41:14,697 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-09-26 21:41:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:14,697 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-09-26 21:41:14,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-09-26 21:41:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:14,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:14,698 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:14,699 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:14,699 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-09-26 21:41:14,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:14,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:14,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:14,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:14,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:15,621 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:15,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:15,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:15,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:15,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-26 21:41:15,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:41:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:41:15,855 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:15,855 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-09-26 21:41:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:20,999 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-09-26 21:41:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:41:20,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-26 21:41:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:21,002 INFO L225 Difference]: With dead ends: 515 [2018-09-26 21:41:21,002 INFO L226 Difference]: Without dead ends: 513 [2018-09-26 21:41:21,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-26 21:41:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-09-26 21:41:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-09-26 21:41:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-09-26 21:41:21,071 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-09-26 21:41:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:21,072 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-09-26 21:41:21,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:41:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-09-26 21:41:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:21,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:21,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:21,073 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:21,073 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-09-26 21:41:21,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:21,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:21,597 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:21,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:21,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:21,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-26 21:41:21,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:41:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:41:21,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:21,777 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-09-26 21:41:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:26,578 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-09-26 21:41:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:41:26,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-26 21:41:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:26,581 INFO L225 Difference]: With dead ends: 631 [2018-09-26 21:41:26,582 INFO L226 Difference]: Without dead ends: 629 [2018-09-26 21:41:26,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-26 21:41:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-09-26 21:41:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 21:41:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-09-26 21:41:26,674 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-09-26 21:41:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-09-26 21:41:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:41:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-09-26 21:41:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:26,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:26,675 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:26,675 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:26,675 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-09-26 21:41:26,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:26,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:26,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:26,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:26,946 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:41:26,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-26 21:41:26,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:26,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:26,947 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-09-26 21:41:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:33,460 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-09-26 21:41:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:41:33,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:41:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:33,464 INFO L225 Difference]: With dead ends: 1330 [2018-09-26 21:41:33,465 INFO L226 Difference]: Without dead ends: 929 [2018-09-26 21:41:33,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-09-26 21:41:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-09-26 21:41:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-09-26 21:41:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-09-26 21:41:33,603 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-09-26 21:41:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:33,603 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-09-26 21:41:33,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-09-26 21:41:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:33,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:33,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:33,604 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:33,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-09-26 21:41:33,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:33,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:33,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:33,813 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:33,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:33,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:34,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:34,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-26 21:41:34,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:34,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:34,179 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-09-26 21:41:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:39,025 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-09-26 21:41:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:41:39,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:41:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:39,029 INFO L225 Difference]: With dead ends: 1557 [2018-09-26 21:41:39,029 INFO L226 Difference]: Without dead ends: 864 [2018-09-26 21:41:39,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-09-26 21:41:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-09-26 21:41:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-26 21:41:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-09-26 21:41:39,208 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-09-26 21:41:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:39,208 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-09-26 21:41:39,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-09-26 21:41:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:39,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:39,209 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:39,210 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:39,210 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-09-26 21:41:39,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:39,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:39,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:39,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:39,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:39,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:39,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:39,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:39,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:39,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-26 21:41:39,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:41:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:41:39,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:39,448 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-09-26 21:41:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:43,003 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-09-26 21:41:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:41:43,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 21:41:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:43,007 INFO L225 Difference]: With dead ends: 1655 [2018-09-26 21:41:43,007 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 21:41:43,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 21:41:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-09-26 21:41:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-09-26 21:41:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-09-26 21:41:43,155 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-09-26 21:41:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:43,155 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-09-26 21:41:43,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:41:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-09-26 21:41:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:43,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:43,156 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:43,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:43,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-09-26 21:41:43,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:43,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:43,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:43,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:43,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:43,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:43,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:43,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-26 21:41:43,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:41:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:41:43,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:43,352 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-09-26 21:41:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:45,449 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-09-26 21:41:45,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:45,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 21:41:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:45,453 INFO L225 Difference]: With dead ends: 939 [2018-09-26 21:41:45,453 INFO L226 Difference]: Without dead ends: 937 [2018-09-26 21:41:45,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-09-26 21:41:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-09-26 21:41:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-09-26 21:41:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-09-26 21:41:45,604 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-09-26 21:41:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:45,605 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-09-26 21:41:45,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:41:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-09-26 21:41:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:45,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:45,606 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:45,606 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:45,606 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-09-26 21:41:45,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:45,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:46,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:46,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:46,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:46,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:46,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:41:46,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-26 21:41:46,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:46,348 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:46,348 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-09-26 21:41:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:52,741 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-09-26 21:41:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:41:52,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:41:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:52,747 INFO L225 Difference]: With dead ends: 2058 [2018-09-26 21:41:52,747 INFO L226 Difference]: Without dead ends: 1239 [2018-09-26 21:41:52,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-09-26 21:41:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-09-26 21:41:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-09-26 21:41:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-09-26 21:41:53,004 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-09-26 21:41:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:53,005 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-09-26 21:41:53,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:41:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-09-26 21:41:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:53,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:53,006 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:53,006 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:53,006 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-09-26 21:41:53,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:53,541 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:53,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:53,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:54,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:41:54,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-26 21:41:54,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:41:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:41:54,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:54,222 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-09-26 21:41:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:56,282 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-09-26 21:41:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:56,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 21:41:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:56,286 INFO L225 Difference]: With dead ends: 1038 [2018-09-26 21:41:56,286 INFO L226 Difference]: Without dead ends: 1036 [2018-09-26 21:41:56,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-26 21:41:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-09-26 21:41:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-09-26 21:41:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-09-26 21:41:56,467 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-09-26 21:41:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:56,468 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-09-26 21:41:56,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:41:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-09-26 21:41:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:41:56,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:56,469 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:56,469 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:56,469 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-09-26 21:41:56,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:56,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:56,562 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:41:56,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:41:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:56,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:41:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:56,720 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:41:56,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-26 21:41:56,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:41:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:41:56,720 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:56,721 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-09-26 21:42:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:02,818 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-09-26 21:42:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:42:02,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:42:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:02,823 INFO L225 Difference]: With dead ends: 2193 [2018-09-26 21:42:02,823 INFO L226 Difference]: Without dead ends: 1286 [2018-09-26 21:42:02,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-09-26 21:42:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-09-26 21:42:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-09-26 21:42:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-09-26 21:42:03,039 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-09-26 21:42:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:03,039 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-09-26 21:42:03,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-09-26 21:42:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:42:03,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:03,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:03,040 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:03,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-09-26 21:42:03,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:03,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:03,126 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:03,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:03,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:03,299 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:03,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-26 21:42:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:03,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:03,300 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-09-26 21:42:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:07,668 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-09-26 21:42:07,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:42:07,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:42:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:07,673 INFO L225 Difference]: With dead ends: 2165 [2018-09-26 21:42:07,673 INFO L226 Difference]: Without dead ends: 1153 [2018-09-26 21:42:07,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-09-26 21:42:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-09-26 21:42:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-09-26 21:42:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-09-26 21:42:07,886 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-09-26 21:42:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:07,886 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-09-26 21:42:07,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-09-26 21:42:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:42:07,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:07,887 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:07,887 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:07,888 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-09-26 21:42:07,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:07,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:07,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:07,964 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:07,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:07,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:07,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:08,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:08,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-26 21:42:08,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:42:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:42:08,128 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:08,128 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-09-26 21:42:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:11,658 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-09-26 21:42:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:42:11,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 21:42:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:11,662 INFO L225 Difference]: With dead ends: 1397 [2018-09-26 21:42:11,662 INFO L226 Difference]: Without dead ends: 1125 [2018-09-26 21:42:11,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-09-26 21:42:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-09-26 21:42:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-09-26 21:42:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-09-26 21:42:11,876 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-09-26 21:42:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:11,876 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-09-26 21:42:11,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:42:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-09-26 21:42:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:42:11,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:11,877 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:11,877 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:11,877 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-09-26 21:42:11,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:11,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:11,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:11,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:11,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:12,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:42:12,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-26 21:42:12,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:12,109 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:12,109 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-09-26 21:42:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:19,149 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-09-26 21:42:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:42:19,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:42:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:19,155 INFO L225 Difference]: With dead ends: 2724 [2018-09-26 21:42:19,156 INFO L226 Difference]: Without dead ends: 1719 [2018-09-26 21:42:19,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-09-26 21:42:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-09-26 21:42:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-09-26 21:42:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-09-26 21:42:19,426 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-09-26 21:42:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:19,426 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-09-26 21:42:19,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-09-26 21:42:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:19,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:19,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:19,428 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:19,428 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-09-26 21:42:19,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:19,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:19,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:19,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:19,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:19,532 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:19,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:19,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:19,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:19,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-09-26 21:42:19,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:42:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:42:19,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:19,744 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 17 states. [2018-09-26 21:42:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:24,899 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-09-26 21:42:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:42:24,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-26 21:42:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:24,904 INFO L225 Difference]: With dead ends: 1442 [2018-09-26 21:42:24,904 INFO L226 Difference]: Without dead ends: 1440 [2018-09-26 21:42:24,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-26 21:42:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-09-26 21:42:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-26 21:42:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-09-26 21:42:25,175 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-09-26 21:42:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:25,175 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-09-26 21:42:25,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:42:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-09-26 21:42:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:42:25,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:25,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:25,176 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:25,177 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-09-26 21:42:25,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:25,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:25,947 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:25,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:26,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:26,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-26 21:42:26,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:42:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:42:26,138 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:26,139 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 16 states. [2018-09-26 21:42:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:30,128 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-09-26 21:42:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:42:30,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 21:42:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:30,133 INFO L225 Difference]: With dead ends: 1389 [2018-09-26 21:42:30,133 INFO L226 Difference]: Without dead ends: 1387 [2018-09-26 21:42:30,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-09-26 21:42:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-09-26 21:42:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-09-26 21:42:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-09-26 21:42:30,401 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-09-26 21:42:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:30,401 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-09-26 21:42:30,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:42:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-09-26 21:42:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:30,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:30,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:30,403 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:30,403 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-09-26 21:42:30,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:30,540 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:30,540 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:30,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:30,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:30,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-26 21:42:30,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:30,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:30,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:30,759 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-09-26 21:42:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:37,314 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-09-26 21:42:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:42:37,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-09-26 21:42:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:37,319 INFO L225 Difference]: With dead ends: 1445 [2018-09-26 21:42:37,319 INFO L226 Difference]: Without dead ends: 1443 [2018-09-26 21:42:37,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-09-26 21:42:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-09-26 21:42:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-26 21:42:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-26 21:42:37,605 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-26 21:42:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:37,606 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-26 21:42:37,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-26 21:42:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:37,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:37,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:37,607 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:37,607 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-09-26 21:42:37,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:37,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:37,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:37,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:37,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:37,732 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:37,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:37,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:37,914 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:37,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-26 21:42:37,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:42:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:42:37,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:37,915 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 15 states. [2018-09-26 21:42:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:43,776 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-09-26 21:42:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:42:43,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-09-26 21:42:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:43,781 INFO L225 Difference]: With dead ends: 1420 [2018-09-26 21:42:43,781 INFO L226 Difference]: Without dead ends: 1418 [2018-09-26 21:42:43,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-09-26 21:42:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-09-26 21:42:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-09-26 21:42:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-09-26 21:42:44,058 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-09-26 21:42:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:44,058 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-09-26 21:42:44,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:42:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-09-26 21:42:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:44,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:44,059 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:44,059 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:44,060 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-09-26 21:42:44,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:44,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:44,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:44,166 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:44,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:44,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:42:44,191 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:42:44,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:42:44,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:44,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:44,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:42:44,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:42:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:42:44,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:44,251 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-09-26 21:42:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:46,949 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-09-26 21:42:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:42:46,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-09-26 21:42:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:46,954 INFO L225 Difference]: With dead ends: 1334 [2018-09-26 21:42:46,954 INFO L226 Difference]: Without dead ends: 1332 [2018-09-26 21:42:46,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-09-26 21:42:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-09-26 21:42:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-26 21:42:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-26 21:42:47,227 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-26 21:42:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:47,227 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-26 21:42:47,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:42:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-26 21:42:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:47,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:47,228 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:47,229 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:47,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-09-26 21:42:47,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:47,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:47,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:42:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:47,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:47,414 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:47,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:47,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:47,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-26 21:42:47,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:42:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:42:47,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:47,490 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-09-26 21:42:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:50,467 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-09-26 21:42:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:42:50,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-09-26 21:42:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:50,473 INFO L225 Difference]: With dead ends: 1330 [2018-09-26 21:42:50,473 INFO L226 Difference]: Without dead ends: 1328 [2018-09-26 21:42:50,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-09-26 21:42:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-09-26 21:42:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-09-26 21:42:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-09-26 21:42:50,739 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-09-26 21:42:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:50,739 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-09-26 21:42:50,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:42:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-09-26 21:42:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:50,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:50,741 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:50,741 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:50,741 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:50,741 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-09-26 21:42:50,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:50,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:50,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:50,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:50,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:50,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:50,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:42:50,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:42:50,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:42:50,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:50,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:50,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-09-26 21:42:50,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:42:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:42:50,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:50,994 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 14 states. [2018-09-26 21:42:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:55,931 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-09-26 21:42:55,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:42:55,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-09-26 21:42:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:55,936 INFO L225 Difference]: With dead ends: 1430 [2018-09-26 21:42:55,936 INFO L226 Difference]: Without dead ends: 1428 [2018-09-26 21:42:55,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-09-26 21:42:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-09-26 21:42:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-26 21:42:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-09-26 21:42:56,229 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-09-26 21:42:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:56,229 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-09-26 21:42:56,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:42:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-09-26 21:42:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:42:56,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:56,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:56,230 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:56,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-09-26 21:42:56,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:56,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:56,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:42:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:56,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:42:56,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:42:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:56,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:42:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:56,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:42:56,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-09-26 21:42:56,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:42:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:42:56,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:56,842 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-09-26 21:43:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:02,368 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-09-26 21:43:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:43:02,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-09-26 21:43:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:02,371 INFO L225 Difference]: With dead ends: 1432 [2018-09-26 21:43:02,372 INFO L226 Difference]: Without dead ends: 1430 [2018-09-26 21:43:02,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-09-26 21:43:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-09-26 21:43:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-09-26 21:43:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-09-26 21:43:02,657 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-09-26 21:43:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:02,657 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-09-26 21:43:02,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:43:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-09-26 21:43:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:02,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:02,658 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:02,659 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:02,659 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-09-26 21:43:02,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:02,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:02,796 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:02,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:02,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:02,959 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:43:02,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-09-26 21:43:02,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:43:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:43:02,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:02,960 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-09-26 21:43:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:13,855 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-09-26 21:43:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 21:43:13,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-26 21:43:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:13,857 INFO L225 Difference]: With dead ends: 1695 [2018-09-26 21:43:13,858 INFO L226 Difference]: Without dead ends: 1376 [2018-09-26 21:43:13,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-09-26 21:43:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-09-26 21:43:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-09-26 21:43:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-09-26 21:43:14,115 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-09-26 21:43:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:14,115 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-09-26 21:43:14,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:43:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-09-26 21:43:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:14,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:14,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:14,117 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:14,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-09-26 21:43:14,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:14,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:14,321 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:14,321 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:14,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:14,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:14,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:14,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-26 21:43:14,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:43:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:43:14,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:14,457 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-09-26 21:43:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:20,121 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-09-26 21:43:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:43:20,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:43:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:20,127 INFO L225 Difference]: With dead ends: 1514 [2018-09-26 21:43:20,127 INFO L226 Difference]: Without dead ends: 1219 [2018-09-26 21:43:20,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-26 21:43:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-09-26 21:43:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-26 21:43:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-09-26 21:43:20,544 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-09-26 21:43:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:20,545 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-09-26 21:43:20,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:43:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-09-26 21:43:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:20,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:20,546 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:20,546 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:20,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-09-26 21:43:20,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:20,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:43:21,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:21,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:21,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:21,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:21,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-26 21:43:21,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:43:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:43:21,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:21,291 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-09-26 21:43:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:27,078 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-09-26 21:43:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:43:27,079 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-26 21:43:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:27,081 INFO L225 Difference]: With dead ends: 2556 [2018-09-26 21:43:27,081 INFO L226 Difference]: Without dead ends: 1529 [2018-09-26 21:43:27,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-26 21:43:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-09-26 21:43:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-09-26 21:43:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-09-26 21:43:27,382 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-09-26 21:43:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:27,383 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-09-26 21:43:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:43:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-09-26 21:43:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:27,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:27,384 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:27,384 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:27,384 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-09-26 21:43:27,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:27,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:27,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:27,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:28,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:28,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:43:28,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:43:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:43:28,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:28,054 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-09-26 21:43:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:33,490 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-09-26 21:43:33,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:43:33,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-26 21:43:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:33,492 INFO L225 Difference]: With dead ends: 1546 [2018-09-26 21:43:33,493 INFO L226 Difference]: Without dead ends: 1291 [2018-09-26 21:43:33,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-09-26 21:43:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-09-26 21:43:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-26 21:43:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-09-26 21:43:33,850 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-09-26 21:43:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:33,850 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-09-26 21:43:33,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:43:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-09-26 21:43:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:43:33,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:33,851 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:33,852 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:33,852 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-09-26 21:43:33,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:33,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:33,920 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:33,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:33,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:33,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:43:33,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:33,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:33,988 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-09-26 21:43:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:35,412 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-09-26 21:43:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:43:35,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-09-26 21:43:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:35,416 INFO L225 Difference]: With dead ends: 1635 [2018-09-26 21:43:35,416 INFO L226 Difference]: Without dead ends: 1494 [2018-09-26 21:43:35,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-09-26 21:43:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-09-26 21:43:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-26 21:43:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-09-26 21:43:35,850 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-09-26 21:43:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:35,850 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-09-26 21:43:35,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-09-26 21:43:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:43:35,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:35,851 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-09-26 21:43:35,852 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:35,852 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-09-26 21:43:35,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:35,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:35,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:36,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:36,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:36,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:36,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2018-09-26 21:43:36,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:43:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:43:36,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:36,213 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 20 states. [2018-09-26 21:43:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:49,759 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-09-26 21:43:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 21:43:49,759 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 21:43:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:49,763 INFO L225 Difference]: With dead ends: 2230 [2018-09-26 21:43:49,763 INFO L226 Difference]: Without dead ends: 2180 [2018-09-26 21:43:49,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-09-26 21:43:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-09-26 21:43:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-09-26 21:43:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-09-26 21:43:50,278 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-09-26 21:43:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:50,278 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-09-26 21:43:50,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:43:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-09-26 21:43:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:43:50,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:50,279 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:50,280 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:50,280 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-09-26 21:43:50,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:50,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:43:50,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:50,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:50,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:50,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:43:50,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:50,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:43:50,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:50,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:50,443 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-09-26 21:43:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:51,282 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-09-26 21:43:51,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:43:51,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-09-26 21:43:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:51,284 INFO L225 Difference]: With dead ends: 1760 [2018-09-26 21:43:51,284 INFO L226 Difference]: Without dead ends: 1507 [2018-09-26 21:43:51,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-09-26 21:43:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-09-26 21:43:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-09-26 21:43:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-09-26 21:43:51,660 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-09-26 21:43:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:51,660 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-09-26 21:43:51,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-09-26 21:43:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:43:51,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:51,661 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-09-26 21:43:51,661 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:51,661 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-09-26 21:43:51,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:51,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:51,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:51,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:52,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:52,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-26 21:43:52,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:43:52,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:43:52,142 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:52,142 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 17 states. [2018-09-26 21:43:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:59,596 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-09-26 21:43:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:43:59,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-09-26 21:43:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:59,598 INFO L225 Difference]: With dead ends: 1878 [2018-09-26 21:43:59,598 INFO L226 Difference]: Without dead ends: 1729 [2018-09-26 21:43:59,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-09-26 21:43:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-09-26 21:43:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-26 21:43:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-09-26 21:43:59,864 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-09-26 21:43:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:59,864 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-09-26 21:43:59,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:43:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-09-26 21:43:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:43:59,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:59,865 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:59,865 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:59,865 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-09-26 21:43:59,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:59,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:59,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:59,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:59,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:44:00,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:00,050 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:44:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:00,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:00,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:00,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-26 21:44:00,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:44:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:44:00,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:00,358 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-09-26 21:44:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:15,890 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-09-26 21:44:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 21:44:15,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-26 21:44:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:15,892 INFO L225 Difference]: With dead ends: 2738 [2018-09-26 21:44:15,892 INFO L226 Difference]: Without dead ends: 1726 [2018-09-26 21:44:15,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-09-26 21:44:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-09-26 21:44:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-09-26 21:44:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-09-26 21:44:16,283 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-09-26 21:44:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:16,284 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-09-26 21:44:16,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:44:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-09-26 21:44:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:44:16,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:16,285 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:16,285 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:16,285 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:16,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-09-26 21:44:16,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:16,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:16,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:16,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:16,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:16,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-09-26 21:44:16,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:16,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:44:16,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:16,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:17,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:17,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-26 21:44:17,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:44:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:44:17,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:17,076 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 20 states. [2018-09-26 21:44:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:32,840 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-09-26 21:44:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 21:44:32,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-26 21:44:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:32,843 INFO L225 Difference]: With dead ends: 2759 [2018-09-26 21:44:32,843 INFO L226 Difference]: Without dead ends: 2757 [2018-09-26 21:44:32,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-09-26 21:44:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-09-26 21:44:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-09-26 21:44:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-09-26 21:44:33,368 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-09-26 21:44:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:33,368 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-09-26 21:44:33,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:44:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-09-26 21:44:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:44:33,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:33,369 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:33,369 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:33,370 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-09-26 21:44:33,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:33,882 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:44:33,882 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:44:33,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:33,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:44:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:34,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:44:34,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-26 21:44:34,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:44:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:44:34,124 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:34,124 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 18 states. Received shutdown request... [2018-09-26 21:44:35,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:44:35,743 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:44:35,750 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:44:35,750 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:44:35 BoogieIcfgContainer [2018-09-26 21:44:35,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:44:35,751 INFO L168 Benchmark]: Toolchain (without parser) took 247582.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 344.3 MB). Peak memory consumption was 449.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:35,753 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:35,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:35,754 INFO L168 Benchmark]: Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:35,755 INFO L168 Benchmark]: RCFGBuilder took 568.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:35,755 INFO L168 Benchmark]: TraceAbstraction took 246938.92 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 323.2 MB). Peak memory consumption was 428.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:35,759 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 568.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246938.92 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 323.2 MB). Peak memory consumption was 428.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (1886states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (1886states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (1886states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (1886states) and FLOYD_HOARE automaton (currently 14 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (39 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 246.8s OverallTime, 48 OverallIterations, 3 TraceHistogramMax, 218.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1851 SDtfs, 7906 SDslu, 5522 SDs, 0 SdLazy, 34127 SolverSat, 3793 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1967 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 1586 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1886occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 47 MinimizatonAttempts, 9471 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1146 ConstructedInterpolants, 125 QuantifiedInterpolants, 116222 SizeOfPredicates, 190 NumberOfNonLiveVariables, 1727 ConjunctsInSsa, 375 ConjunctsInUnsatCore, 89 InterpolantComputations, 14 PerfectInterpolantSequences, 115/432 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-44-35-770.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-44-35-770.csv Completed graceful shutdown