java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:43:11,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:43:11,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:43:11,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:43:11,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:43:11,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:43:11,886 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:43:11,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:43:11,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:43:11,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:43:11,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:43:11,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:43:11,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:43:11,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:43:11,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:43:11,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:43:11,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:43:11,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:43:11,900 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:43:11,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:43:11,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:43:11,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:43:11,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:43:11,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:43:11,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:43:11,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:43:11,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:43:11,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:43:11,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:43:11,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:43:11,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:43:11,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:43:11,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:43:11,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:43:11,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:43:11,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:43:11,917 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-30 10:43:11,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:43:11,934 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:43:11,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:43:11,935 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:43:11,936 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:43:11,936 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:43:11,936 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:43:11,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:43:11,937 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:43:11,937 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:43:11,937 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:43:11,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:43:11,938 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:43:11,938 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:43:11,938 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:43:11,938 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:43:11,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:43:11,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:43:11,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:43:11,939 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:43:11,939 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:43:11,939 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:43:11,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:43:11,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:43:11,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:43:11,940 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:43:11,940 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:43:11,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:43:11,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:43:11,941 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:43:11,941 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:43:11,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:43:12,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:43:12,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:43:12,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:43:12,020 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:43:12,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-30 10:43:12,021 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-30 10:43:12,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:43:12,086 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:43:12,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:43:12,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:43:12,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:43:12,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,127 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:43:12,128 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:43:12,128 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:43:12,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:43:12,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:43:12,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:43:12,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:43:12,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/1) ... [2018-09-30 10:43:12,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:43:12,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:43:12,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:43:12,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:43:12,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (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-30 10:43:12,239 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:43:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:43:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:43:12,676 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:43:12,676 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:43:12 BoogieIcfgContainer [2018-09-30 10:43:12,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:43:12,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:43:12,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:43:12,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:43:12,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:43:12" (1/2) ... [2018-09-30 10:43:12,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47852c24 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:43:12, skipping insertion in model container [2018-09-30 10:43:12,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:43:12" (2/2) ... [2018-09-30 10:43:12,687 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-30 10:43:12,695 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:43:12,707 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 10:43:12,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:43:12,760 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:43:12,760 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:43:12,760 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:43:12,760 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:43:12,761 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:43:12,761 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:43:12,761 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:43:12,762 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:43:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-30 10:43:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:43:12,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:12,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:43:12,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:12,792 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-30 10:43:12,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:13,035 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-30 10:43:13,037 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:13,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:43:13,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:43:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:43:13,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:13,059 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-30 10:43:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:14,584 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-30 10:43:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:43:14,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:43:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:14,600 INFO L225 Difference]: With dead ends: 32 [2018-09-30 10:43:14,600 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:43:14,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:43:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-30 10:43:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 10:43:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-30 10:43:14,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-30 10:43:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:14,640 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-30 10:43:14,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:43:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-30 10:43:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:43:14,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:14,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:43:14,642 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:14,642 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-30 10:43:14,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:14,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:14,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:14,701 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-30 10:43:14,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:14,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:43:14,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:43:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:43:14,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:14,704 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-30 10:43:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:15,346 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-30 10:43:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:43:15,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:43:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:15,349 INFO L225 Difference]: With dead ends: 38 [2018-09-30 10:43:15,349 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 10:43:15,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 10:43:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-30 10:43:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:43:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-30 10:43:15,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-30 10:43:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:15,358 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-30 10:43:15,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:43:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-30 10:43:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:43:15,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:15,359 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:43:15,360 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:15,360 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-30 10:43:15,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:15,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:15,475 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-30 10:43:15,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:15,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:43:15,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:43:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:43:15,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:15,476 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-30 10:43:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:16,253 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-30 10:43:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:43:16,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:43:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:16,255 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:43:16,256 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:43:16,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:43:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-30 10:43:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:43:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-30 10:43:16,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-30 10:43:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:16,267 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-30 10:43:16,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:43:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-30 10:43:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:43:16,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:16,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:43:16,268 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:16,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-30 10:43:16,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:16,645 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-30 10:43:16,645 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:16,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:43:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:43:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:43:16,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:16,648 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-30 10:43:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:17,354 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-30 10:43:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:43:17,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:43:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:17,357 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:43:17,357 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 10:43:17,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 10:43:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-30 10:43:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:43:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-30 10:43:17,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-30 10:43:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-30 10:43:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:43:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-30 10:43:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:17,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:17,372 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:17,372 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:17,372 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-30 10:43:17,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:17,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:17,477 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-30 10:43:17,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:17,478 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-30 10:43:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:17,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:17,960 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-30 10:43:17,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:17,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:43:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:17,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:17,983 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-09-30 10:43:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:20,626 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-09-30 10:43:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:43:20,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-09-30 10:43:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:20,629 INFO L225 Difference]: With dead ends: 107 [2018-09-30 10:43:20,629 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 10:43:20,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 10:43:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-09-30 10:43:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 10:43:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-09-30 10:43:20,645 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-09-30 10:43:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-09-30 10:43:20,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-09-30 10:43:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:20,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:20,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:20,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:20,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-30 10:43:20,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:20,743 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-30 10:43:20,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:20,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:20,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:20,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:20,745 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-09-30 10:43:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:22,679 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-09-30 10:43:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:22,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:22,684 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:43:22,684 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:43:22,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:43:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-30 10:43:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:43:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-09-30 10:43:22,700 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-09-30 10:43:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:22,700 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-09-30 10:43:22,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-09-30 10:43:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:22,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:22,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:22,702 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:22,702 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-30 10:43:22,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:22,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:23,040 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-30 10:43:23,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:23,040 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-30 10:43:23,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:23,274 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-30 10:43:23,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:23,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 10:43:23,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:23,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:23,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:23,297 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-09-30 10:43:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:28,303 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-09-30 10:43:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:43:28,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 10:43:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:28,306 INFO L225 Difference]: With dead ends: 150 [2018-09-30 10:43:28,306 INFO L226 Difference]: Without dead ends: 148 [2018-09-30 10:43:28,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-30 10:43:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-09-30 10:43:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-30 10:43:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-09-30 10:43:28,327 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-09-30 10:43:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:28,327 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-09-30 10:43:28,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-09-30 10:43:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:28,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:28,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:28,329 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:28,329 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-30 10:43:28,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:28,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:28,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:28,409 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-30 10:43:28,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:28,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:43:28,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:28,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:28,575 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-30 10:43:28,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:28,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-09-30 10:43:28,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:28,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:28,597 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-09-30 10:43:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:30,849 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-30 10:43:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:43:30,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 10:43:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:30,851 INFO L225 Difference]: With dead ends: 137 [2018-09-30 10:43:30,852 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 10:43:30,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 10:43:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-30 10:43:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:43:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-30 10:43:30,873 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-30 10:43:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:30,873 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-30 10:43:30,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-30 10:43:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:30,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:30,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:30,875 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:30,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-30 10:43:30,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:30,960 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-30 10:43:30,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:30,961 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-30 10:43:30,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:30,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:31,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:31,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-09-30 10:43:31,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:31,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:31,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:31,087 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-09-30 10:43:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:34,502 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-09-30 10:43:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:43:34,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 10:43:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:34,504 INFO L225 Difference]: With dead ends: 211 [2018-09-30 10:43:34,504 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 10:43:34,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 10:43:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-09-30 10:43:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 10:43:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-09-30 10:43:34,537 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-09-30 10:43:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:34,537 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-09-30 10:43:34,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-09-30 10:43:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:34,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:34,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:34,539 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:34,539 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-30 10:43:34,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:34,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:34,616 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-30 10:43:34,616 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:34,617 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:43:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:34,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:34,711 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-30 10:43:34,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:34,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:43:34,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:43:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:43:34,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:34,733 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-09-30 10:43:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:36,661 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-09-30 10:43:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:36,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-09-30 10:43:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:36,670 INFO L225 Difference]: With dead ends: 246 [2018-09-30 10:43:36,670 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 10:43:36,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 10:43:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-09-30 10:43:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 10:43:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-09-30 10:43:36,712 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-09-30 10:43:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:36,712 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-09-30 10:43:36,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:43:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-09-30 10:43:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:36,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:36,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:36,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:36,714 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:36,714 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-30 10:43:36,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:36,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:36,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:36,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:36,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:36,825 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-30 10:43:36,825 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:36,825 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-30 10:43:36,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:36,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:36,891 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-30 10:43:36,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:36,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:43:36,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:43:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:43:36,913 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:36,913 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-09-30 10:43:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:37,810 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-09-30 10:43:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:43:37,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:43:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:37,812 INFO L225 Difference]: With dead ends: 252 [2018-09-30 10:43:37,813 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 10:43:37,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 10:43:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-09-30 10:43:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-30 10:43:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-09-30 10:43:37,845 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-09-30 10:43:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:37,845 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-09-30 10:43:37,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-09-30 10:43:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:37,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:37,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:37,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:37,848 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-30 10:43:37,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:37,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:37,924 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-30 10:43:37,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:37,925 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-30 10:43:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:37,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:38,051 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-30 10:43:38,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:38,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 10:43:38,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:43:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:43:38,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:38,083 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-09-30 10:43:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:39,704 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-09-30 10:43:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:43:39,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-30 10:43:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:39,707 INFO L225 Difference]: With dead ends: 260 [2018-09-30 10:43:39,707 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 10:43:39,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 10:43:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-09-30 10:43:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-30 10:43:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-09-30 10:43:39,742 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-09-30 10:43:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:39,742 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-09-30 10:43:39,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:43:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-09-30 10:43:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:39,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:39,743 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:39,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:39,746 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-30 10:43:39,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:39,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:39,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:39,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:39,823 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-30 10:43:39,823 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:39,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:43:39,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:43:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:43:39,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:39,824 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-09-30 10:43:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:40,789 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-09-30 10:43:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:43:40,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:43:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:40,800 INFO L225 Difference]: With dead ends: 316 [2018-09-30 10:43:40,801 INFO L226 Difference]: Without dead ends: 314 [2018-09-30 10:43:40,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-30 10:43:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-09-30 10:43:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 10:43:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-09-30 10:43:40,840 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-09-30 10:43:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:40,840 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-09-30 10:43:40,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-09-30 10:43:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:40,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:40,841 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:40,842 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:40,842 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-30 10:43:40,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:40,905 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-30 10:43:40,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:40,906 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-30 10:43:40,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:40,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:40,961 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-30 10:43:40,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:40,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:43:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:43:40,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:43:40,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:40,983 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-09-30 10:43:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:41,799 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-09-30 10:43:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:43:41,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:43:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:41,802 INFO L225 Difference]: With dead ends: 428 [2018-09-30 10:43:41,802 INFO L226 Difference]: Without dead ends: 426 [2018-09-30 10:43:41,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-09-30 10:43:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-09-30 10:43:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-30 10:43:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-09-30 10:43:41,876 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-09-30 10:43:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:41,876 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-09-30 10:43:41,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-09-30 10:43:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:41,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:41,877 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:41,878 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:41,878 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-30 10:43:41,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:41,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:41,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:41,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:41,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:41,984 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-30 10:43:41,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:41,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:43:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:42,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:42,065 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-30 10:43:42,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:42,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 10:43:42,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:43:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:43:42,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:42,087 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-09-30 10:43:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:45,034 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-09-30 10:43:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:43:45,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 10:43:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:45,037 INFO L225 Difference]: With dead ends: 466 [2018-09-30 10:43:45,037 INFO L226 Difference]: Without dead ends: 464 [2018-09-30 10:43:45,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-30 10:43:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-09-30 10:43:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-30 10:43:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-09-30 10:43:45,101 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-09-30 10:43:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:45,101 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-09-30 10:43:45,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:43:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-09-30 10:43:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:45,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:45,102 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:45,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:45,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-30 10:43:45,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:45,375 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-30 10:43:45,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:45,376 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-30 10:43:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:45,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:45,475 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-30 10:43:45,496 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:43:45,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-09-30 10:43:45,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:43:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:43:45,497 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:45,498 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-09-30 10:43:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:50,316 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-09-30 10:43:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:43:50,322 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-09-30 10:43:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:50,325 INFO L225 Difference]: With dead ends: 859 [2018-09-30 10:43:50,325 INFO L226 Difference]: Without dead ends: 509 [2018-09-30 10:43:50,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-09-30 10:43:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-09-30 10:43:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-30 10:43:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-09-30 10:43:50,423 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-09-30 10:43:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:50,423 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-09-30 10:43:50,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:43:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-09-30 10:43:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:50,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:50,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:50,425 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:50,425 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-30 10:43:50,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:50,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:50,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:50,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:50,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:50,871 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-30 10:43:50,872 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:50,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:50,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:50,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:50,873 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-09-30 10:43:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:52,198 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-09-30 10:43:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:43:52,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 10:43:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:52,201 INFO L225 Difference]: With dead ends: 481 [2018-09-30 10:43:52,201 INFO L226 Difference]: Without dead ends: 479 [2018-09-30 10:43:52,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-30 10:43:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-09-30 10:43:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 10:43:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-09-30 10:43:52,290 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-09-30 10:43:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:52,291 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-09-30 10:43:52,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-09-30 10:43:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:52,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:52,292 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:52,292 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:52,292 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-09-30 10:43:52,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:52,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:52,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:52,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:52,449 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-30 10:43:52,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:52,449 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-30 10:43:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:52,758 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-30 10:43:52,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:52,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 10:43:52,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:52,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:52,792 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-09-30 10:43:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:56,445 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-09-30 10:43:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:43:56,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 10:43:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:56,448 INFO L225 Difference]: With dead ends: 952 [2018-09-30 10:43:56,448 INFO L226 Difference]: Without dead ends: 559 [2018-09-30 10:43:56,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-30 10:43:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-09-30 10:43:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-30 10:43:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-09-30 10:43:56,555 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-09-30 10:43:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:56,555 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-09-30 10:43:56,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-09-30 10:43:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:56,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:56,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:56,557 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:56,557 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-30 10:43:56,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:56,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:56,636 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-30 10:43:56,636 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:56,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:56,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:56,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:56,637 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-09-30 10:43:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:57,595 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-09-30 10:43:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:43:57,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 10:43:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:57,597 INFO L225 Difference]: With dead ends: 524 [2018-09-30 10:43:57,597 INFO L226 Difference]: Without dead ends: 522 [2018-09-30 10:43:57,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-30 10:43:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-09-30 10:43:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-30 10:43:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-09-30 10:43:57,716 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-09-30 10:43:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:57,716 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-09-30 10:43:57,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-09-30 10:43:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:57,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:57,717 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:57,718 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:57,718 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-30 10:43:57,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:57,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:57,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:57,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:57,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:58,174 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-30 10:43:58,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:58,175 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-30 10:43:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:58,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:58,370 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-30 10:43:58,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:58,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-30 10:43:58,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:58,393 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:58,393 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-09-30 10:44:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:00,875 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-09-30 10:44:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:44:00,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-30 10:44:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:00,881 INFO L225 Difference]: With dead ends: 556 [2018-09-30 10:44:00,882 INFO L226 Difference]: Without dead ends: 554 [2018-09-30 10:44:00,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-30 10:44:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-09-30 10:44:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-30 10:44:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-09-30 10:44:00,998 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-09-30 10:44:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:00,998 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-09-30 10:44:00,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-09-30 10:44:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:00,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:00,999 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:00,999 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:00,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-30 10:44:01,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:01,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:01,108 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-30 10:44:01,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:01,109 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-30 10:44:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:01,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:01,574 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-30 10:44:01,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:01,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-09-30 10:44:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:44:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:44:01,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:01,611 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-09-30 10:44:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:05,463 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-09-30 10:44:05,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:44:05,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 10:44:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:05,466 INFO L225 Difference]: With dead ends: 631 [2018-09-30 10:44:05,466 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 10:44:05,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 10:44:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-09-30 10:44:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-09-30 10:44:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-09-30 10:44:05,593 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-09-30 10:44:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-09-30 10:44:05,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:44:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-09-30 10:44:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:05,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:05,594 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:05,594 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:05,594 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-30 10:44:05,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:05,860 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-30 10:44:05,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:05,860 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-30 10:44:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:44:05,875 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:44:05,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:44:05,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:05,904 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-30 10:44:05,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:05,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:44:05,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:05,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:05,925 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-09-30 10:44:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:07,123 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-09-30 10:44:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:44:07,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:44:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:07,128 INFO L225 Difference]: With dead ends: 601 [2018-09-30 10:44:07,128 INFO L226 Difference]: Without dead ends: 599 [2018-09-30 10:44:07,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-30 10:44:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-09-30 10:44:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-30 10:44:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-09-30 10:44:07,248 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-09-30 10:44:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:07,248 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-09-30 10:44:07,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-09-30 10:44:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:07,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:07,249 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:07,250 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:07,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-30 10:44:07,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:07,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:07,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:44:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:07,352 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-30 10:44:07,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:07,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:44:07,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:07,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:07,381 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-30 10:44:07,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:07,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:44:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:07,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:07,403 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-09-30 10:44:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:08,791 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-09-30 10:44:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:44:08,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:44:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:08,793 INFO L225 Difference]: With dead ends: 624 [2018-09-30 10:44:08,793 INFO L226 Difference]: Without dead ends: 622 [2018-09-30 10:44:08,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-09-30 10:44:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-09-30 10:44:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-09-30 10:44:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-09-30 10:44:08,899 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-09-30 10:44:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:08,900 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-09-30 10:44:08,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-09-30 10:44:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:08,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:08,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:08,901 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:08,901 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-30 10:44:08,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:08,974 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-30 10:44:08,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:08,974 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-30 10:44:08,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:08,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:09,021 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-30 10:44:09,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:09,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:44:09,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:09,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:09,041 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-09-30 10:44:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:10,293 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-09-30 10:44:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:44:10,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:44:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:10,296 INFO L225 Difference]: With dead ends: 584 [2018-09-30 10:44:10,296 INFO L226 Difference]: Without dead ends: 582 [2018-09-30 10:44:10,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-30 10:44:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-09-30 10:44:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-30 10:44:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-09-30 10:44:10,396 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-09-30 10:44:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:10,397 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-09-30 10:44:10,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-09-30 10:44:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:10,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:10,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:10,398 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:10,398 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-30 10:44:10,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:10,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:10,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:10,485 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-30 10:44:10,485 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:10,485 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-30 10:44:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:10,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:10,528 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-30 10:44:10,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:10,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:44:10,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:10,551 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:10,551 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-09-30 10:44:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:11,868 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-09-30 10:44:11,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:44:11,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:44:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:11,871 INFO L225 Difference]: With dead ends: 618 [2018-09-30 10:44:11,871 INFO L226 Difference]: Without dead ends: 616 [2018-09-30 10:44:11,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-09-30 10:44:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-09-30 10:44:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-09-30 10:44:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-09-30 10:44:11,968 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-09-30 10:44:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:11,968 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-09-30 10:44:11,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-09-30 10:44:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:44:11,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:11,969 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:11,970 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:11,970 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-30 10:44:11,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:11,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:12,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:12,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:44:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:12,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:12,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:12,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:44:12,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:12,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:12,540 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-09-30 10:44:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:13,730 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-09-30 10:44:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:44:13,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:44:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:13,733 INFO L225 Difference]: With dead ends: 613 [2018-09-30 10:44:13,733 INFO L226 Difference]: Without dead ends: 611 [2018-09-30 10:44:13,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-30 10:44:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-09-30 10:44:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-30 10:44:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-09-30 10:44:13,840 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-09-30 10:44:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:13,840 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-09-30 10:44:13,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-09-30 10:44:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:13,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:13,841 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:13,841 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:13,841 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-30 10:44:13,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:13,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:14,108 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-30 10:44:14,108 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:14,108 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:44:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:14,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:14,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:14,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 10:44:14,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:14,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:14,252 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 14 states. [2018-09-30 10:44:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:17,317 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-09-30 10:44:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:44:17,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-09-30 10:44:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:17,321 INFO L225 Difference]: With dead ends: 875 [2018-09-30 10:44:17,322 INFO L226 Difference]: Without dead ends: 873 [2018-09-30 10:44:17,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-09-30 10:44:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-09-30 10:44:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-30 10:44:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-09-30 10:44:17,458 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-09-30 10:44:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:17,458 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-09-30 10:44:17,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-09-30 10:44:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:17,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:17,459 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:17,459 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:17,460 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-30 10:44:17,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:17,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:17,553 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-30 10:44:17,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:17,553 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-30 10:44:17,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:17,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:17,671 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-30 10:44:17,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:17,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-30 10:44:17,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:44:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:44:17,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:17,694 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-09-30 10:44:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:21,890 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-09-30 10:44:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:44:21,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-30 10:44:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:21,895 INFO L225 Difference]: With dead ends: 1281 [2018-09-30 10:44:21,895 INFO L226 Difference]: Without dead ends: 1279 [2018-09-30 10:44:21,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-09-30 10:44:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-09-30 10:44:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-30 10:44:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-30 10:44:22,089 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-09-30 10:44:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-30 10:44:22,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:44:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-30 10:44:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:44:22,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:22,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:22,091 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:22,091 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-30 10:44:22,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:22,163 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-30 10:44:22,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:22,163 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-30 10:44:22,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:22,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:22,232 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-30 10:44:22,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:22,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:44:22,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:44:22,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:44:22,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:22,256 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-09-30 10:44:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:24,295 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-09-30 10:44:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:44:24,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 10:44:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:24,299 INFO L225 Difference]: With dead ends: 1054 [2018-09-30 10:44:24,299 INFO L226 Difference]: Without dead ends: 1052 [2018-09-30 10:44:24,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-09-30 10:44:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-09-30 10:44:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 10:44:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-09-30 10:44:24,494 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-09-30 10:44:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:24,494 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-09-30 10:44:24,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:44:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-09-30 10:44:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:44:24,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:24,495 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:24,495 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:24,496 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-09-30 10:44:24,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:24,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:24,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:24,614 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-30 10:44:24,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:24,614 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-30 10:44:24,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:44:24,629 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:44:24,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:44:24,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:24,787 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-30 10:44:24,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:24,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-09-30 10:44:24,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:24,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:24,809 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 14 states. [2018-09-30 10:44:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:28,858 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-09-30 10:44:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:44:28,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 10:44:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:28,863 INFO L225 Difference]: With dead ends: 1125 [2018-09-30 10:44:28,863 INFO L226 Difference]: Without dead ends: 1123 [2018-09-30 10:44:28,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-30 10:44:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-09-30 10:44:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-30 10:44:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-30 10:44:29,059 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-09-30 10:44:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:29,059 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-30 10:44:29,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-30 10:44:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:44:29,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:29,060 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:29,060 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:29,061 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-09-30 10:44:29,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:29,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:44:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:29,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:29,144 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-30 10:44:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:29,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:29,316 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-30 10:44:29,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:29,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-30 10:44:29,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:44:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:44:29,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:29,338 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-09-30 10:44:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:33,574 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-09-30 10:44:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:44:33,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 10:44:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:33,578 INFO L225 Difference]: With dead ends: 1125 [2018-09-30 10:44:33,579 INFO L226 Difference]: Without dead ends: 1123 [2018-09-30 10:44:33,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-30 10:44:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-09-30 10:44:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-09-30 10:44:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-09-30 10:44:33,759 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-09-30 10:44:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:33,759 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-09-30 10:44:33,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:44:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-09-30 10:44:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:44:33,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:33,760 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:33,760 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:33,760 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-30 10:44:33,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:33,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:33,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:33,966 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-30 10:44:33,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:33,967 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-30 10:44:33,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:33,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:34,017 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-30 10:44:34,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:34,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-09-30 10:44:34,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:44:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:44:34,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:34,040 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-09-30 10:44:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:36,563 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-09-30 10:44:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:44:36,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-30 10:44:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:36,567 INFO L225 Difference]: With dead ends: 1117 [2018-09-30 10:44:36,567 INFO L226 Difference]: Without dead ends: 1115 [2018-09-30 10:44:36,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-09-30 10:44:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-09-30 10:44:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-09-30 10:44:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-09-30 10:44:36,764 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-09-30 10:44:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:36,764 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-09-30 10:44:36,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:44:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-09-30 10:44:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:44:36,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:36,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:36,765 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:36,765 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-30 10:44:36,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:36,844 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-30 10:44:36,845 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:36,845 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-30 10:44:36,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:36,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:36,897 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-30 10:44:36,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:36,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:44:36,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:44:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:44:36,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:36,920 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-09-30 10:44:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:38,736 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-09-30 10:44:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:44:38,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 10:44:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:38,739 INFO L225 Difference]: With dead ends: 995 [2018-09-30 10:44:38,740 INFO L226 Difference]: Without dead ends: 993 [2018-09-30 10:44:38,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-09-30 10:44:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-09-30 10:44:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-09-30 10:44:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-09-30 10:44:38,938 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-09-30 10:44:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:38,939 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-09-30 10:44:38,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:44:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-09-30 10:44:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:38,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:38,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:44:38,940 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:38,940 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-09-30 10:44:38,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:38,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:39,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:39,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 10:44:39,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:44:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:39,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:40,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:40,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 10:44:40,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:44:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:44:40,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:40,312 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-09-30 10:44:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:46,471 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-09-30 10:44:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:44:46,471 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 10:44:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:46,475 INFO L225 Difference]: With dead ends: 2105 [2018-09-30 10:44:46,475 INFO L226 Difference]: Without dead ends: 1229 [2018-09-30 10:44:46,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-09-30 10:44:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-09-30 10:44:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-09-30 10:44:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-09-30 10:44:46,719 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-09-30 10:44:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:46,719 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-09-30 10:44:46,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:44:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-09-30 10:44:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:46,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:46,720 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:46,721 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:46,721 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-09-30 10:44:46,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:46,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:46,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:46,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:46,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:46,831 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-30 10:44:46,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:46,831 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-30 10:44:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:46,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:46,951 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-30 10:44:46,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:46,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:44:46,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:44:46,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:44:46,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:46,973 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-09-30 10:44:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:52,357 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-09-30 10:44:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:44:52,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:44:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:52,361 INFO L225 Difference]: With dead ends: 2110 [2018-09-30 10:44:52,361 INFO L226 Difference]: Without dead ends: 1097 [2018-09-30 10:44:52,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-30 10:44:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-09-30 10:44:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-30 10:44:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-09-30 10:44:52,596 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-09-30 10:44:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:52,597 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-09-30 10:44:52,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:44:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-09-30 10:44:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:52,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:52,597 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:52,598 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:52,598 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-09-30 10:44:52,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:52,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:52,774 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-30 10:44:52,774 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:52,774 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-30 10:44:52,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:52,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:52,848 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-30 10:44:52,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:52,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:44:52,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:44:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:44:52,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:52,870 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-09-30 10:44:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:58,742 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-09-30 10:44:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:44:58,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:44:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:58,748 INFO L225 Difference]: With dead ends: 2832 [2018-09-30 10:44:58,748 INFO L226 Difference]: Without dead ends: 1867 [2018-09-30 10:44:58,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-09-30 10:44:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-09-30 10:44:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-09-30 10:44:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-09-30 10:44:59,181 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-09-30 10:44:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-09-30 10:44:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:44:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-09-30 10:44:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:44:59,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:59,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:59,183 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:59,183 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-30 10:44:59,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:59,272 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:44:59,272 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-30 10:44:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:59,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:44:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:44:59,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:44:59,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 10:44:59,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:44:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:44:59,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:59,388 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-09-30 10:45:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:09,337 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-09-30 10:45:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:45:09,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:45:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:09,364 INFO L225 Difference]: With dead ends: 4461 [2018-09-30 10:45:09,364 INFO L226 Difference]: Without dead ends: 2887 [2018-09-30 10:45:09,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-09-30 10:45:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-09-30 10:45:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-09-30 10:45:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-09-30 10:45:10,394 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-09-30 10:45:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:10,394 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-09-30 10:45:10,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:45:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-09-30 10:45:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:45:10,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:10,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:45:10,396 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:10,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:10,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-30 10:45:10,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:10,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:10,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:10,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:10,495 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:45:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:10,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:10,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:10,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 10:45:10,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:45:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:45:10,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:10,715 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-09-30 10:45:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:20,122 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-09-30 10:45:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 10:45:20,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 10:45:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:20,129 INFO L225 Difference]: With dead ends: 3903 [2018-09-30 10:45:20,130 INFO L226 Difference]: Without dead ends: 3227 [2018-09-30 10:45:20,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-09-30 10:45:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-09-30 10:45:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-09-30 10:45:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-09-30 10:45:20,785 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-09-30 10:45:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:20,785 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-09-30 10:45:20,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:45:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-09-30 10:45:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:45:20,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:20,787 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:20,787 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:20,787 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-09-30 10:45:20,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:20,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:21,237 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:21,237 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-30 10:45:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:21,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:21,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:21,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 10:45:21,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:45:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:45:21,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:21,371 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-09-30 10:45:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:27,681 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-09-30 10:45:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:45:27,682 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:45:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:27,689 INFO L225 Difference]: With dead ends: 5427 [2018-09-30 10:45:27,690 INFO L226 Difference]: Without dead ends: 2851 [2018-09-30 10:45:27,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-09-30 10:45:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-09-30 10:45:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-09-30 10:45:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-09-30 10:45:28,382 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-09-30 10:45:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:28,383 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-09-30 10:45:28,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:45:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-09-30 10:45:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:45:28,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:28,384 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:45:28,384 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:28,384 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-09-30 10:45:28,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:28,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:28,487 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:45:28,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:28,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:28,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:28,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:45:28,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:45:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:45:28,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:28,609 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-09-30 10:45:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:34,986 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-09-30 10:45:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:45:34,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:45:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:34,993 INFO L225 Difference]: With dead ends: 5837 [2018-09-30 10:45:34,993 INFO L226 Difference]: Without dead ends: 3072 [2018-09-30 10:45:34,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-09-30 10:45:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-09-30 10:45:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-30 10:45:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-09-30 10:45:35,774 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-09-30 10:45:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:35,774 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-09-30 10:45:35,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:45:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-09-30 10:45:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:35,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:35,775 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:45:35,776 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:35,776 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-09-30 10:45:35,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:35,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:35,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:45:35,892 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:35,893 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-30 10:45:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:35,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:36,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:36,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 10:45:36,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:45:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:45:36,109 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:36,109 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-09-30 10:45:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:53,930 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-09-30 10:45:53,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 10:45:53,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-09-30 10:45:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:53,936 INFO L225 Difference]: With dead ends: 5120 [2018-09-30 10:45:53,937 INFO L226 Difference]: Without dead ends: 3342 [2018-09-30 10:45:53,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-09-30 10:45:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-09-30 10:45:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-09-30 10:45:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-09-30 10:45:54,875 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-09-30 10:45:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:54,875 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-09-30 10:45:54,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:45:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-09-30 10:45:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:45:54,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:54,877 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:54,877 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:54,877 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:54,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-09-30 10:45:54,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:54,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:54,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:55,019 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:55,019 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-30 10:45:55,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:55,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:45:55,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:55,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 10:45:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:45:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:45:55,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:55,196 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 18 states. [2018-09-30 10:46:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:03,577 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-09-30 10:46:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:46:03,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:46:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:03,584 INFO L225 Difference]: With dead ends: 3487 [2018-09-30 10:46:03,584 INFO L226 Difference]: Without dead ends: 3485 [2018-09-30 10:46:03,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-09-30 10:46:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-09-30 10:46:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-09-30 10:46:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-09-30 10:46:04,518 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-09-30 10:46:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-09-30 10:46:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:46:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-09-30 10:46:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:46:04,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:04,519 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:04,520 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:04,520 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-09-30 10:46:04,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:04,644 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:04,644 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-30 10:46:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:04,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:46:04,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:04,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 10:46:04,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:46:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:46:04,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:04,859 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 18 states. [2018-09-30 10:46:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:13,871 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-09-30 10:46:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:46:13,872 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:46:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:13,878 INFO L225 Difference]: With dead ends: 3557 [2018-09-30 10:46:13,878 INFO L226 Difference]: Without dead ends: 3555 [2018-09-30 10:46:13,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-09-30 10:46:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-09-30 10:46:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-09-30 10:46:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-09-30 10:46:14,754 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-09-30 10:46:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:14,754 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-09-30 10:46:14,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:46:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-09-30 10:46:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:46:14,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:14,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:14,756 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:14,756 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-09-30 10:46:14,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:14,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:14,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:14,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:14,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:46:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:46:14,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:46:14,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:46:14,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:15,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:15,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-30 10:46:15,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:46:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:46:15,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:15,084 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-09-30 10:46:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:36,185 INFO L93 Difference]: Finished difference Result 5268 states and 8851 transitions. [2018-09-30 10:46:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-30 10:46:36,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:46:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:36,190 INFO L225 Difference]: With dead ends: 5268 [2018-09-30 10:46:36,190 INFO L226 Difference]: Without dead ends: 5266 [2018-09-30 10:46:36,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-09-30 10:46:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 3515. [2018-09-30 10:46:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-09-30 10:46:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-09-30 10:46:37,103 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-09-30 10:46:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:37,103 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-09-30 10:46:37,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:46:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-09-30 10:46:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:46:37,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:37,104 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:37,104 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:37,104 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-09-30 10:46:37,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:37,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:37,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:46:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:37,218 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-30 10:46:37,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:37,218 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-30 10:46:37,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:46:37,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:46:37,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:46:37,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:37,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:37,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-30 10:46:37,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:46:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:46:37,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:37,453 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-09-30 10:46:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:57,538 INFO L93 Difference]: Finished difference Result 4833 states and 8093 transitions. [2018-09-30 10:46:57,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-30 10:46:57,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:46:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:57,542 INFO L225 Difference]: With dead ends: 4833 [2018-09-30 10:46:57,542 INFO L226 Difference]: Without dead ends: 4831 [2018-09-30 10:46:57,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2018-09-30 10:46:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 3405. [2018-09-30 10:46:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-09-30 10:46:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-09-30 10:46:58,521 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-09-30 10:46:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:58,521 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-09-30 10:46:58,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:46:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-09-30 10:46:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:46:58,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:58,522 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:58,523 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:58,523 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-09-30 10:46:58,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:58,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:46:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:58,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:46:58,640 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-30 10:46:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:46:58,656 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:46:58,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:46:58,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:46:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:46:58,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:46:58,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-30 10:46:58,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:46:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:46:58,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:58,772 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-09-30 10:47:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:05,213 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-09-30 10:47:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:47:05,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:47:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:05,216 INFO L225 Difference]: With dead ends: 5774 [2018-09-30 10:47:05,217 INFO L226 Difference]: Without dead ends: 3100 [2018-09-30 10:47:05,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-09-30 10:47:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-09-30 10:47:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-09-30 10:47:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-09-30 10:47:06,007 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-09-30 10:47:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:06,007 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-09-30 10:47:06,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:47:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-09-30 10:47:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:47:06,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:06,008 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:47:06,009 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:06,009 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-09-30 10:47:06,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:06,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:06,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:47:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:47:06,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:06,118 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-30 10:47:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:47:06,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:06,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 10:47:06,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:47:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:47:06,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:06,291 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 18 states. [2018-09-30 10:47:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:47:12,866 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-09-30 10:47:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:47:12,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:47:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:47:12,869 INFO L225 Difference]: With dead ends: 3114 [2018-09-30 10:47:12,870 INFO L226 Difference]: Without dead ends: 3112 [2018-09-30 10:47:12,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:47:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-09-30 10:47:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-09-30 10:47:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-09-30 10:47:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-09-30 10:47:13,653 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-09-30 10:47:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:47:13,653 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-09-30 10:47:13,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:47:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-09-30 10:47:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:47:13,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:47:13,654 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:47:13,655 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:47:13,655 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:47:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-09-30 10:47:13,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:47:13,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:47:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:13,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:47:13,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:47:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:47:13,836 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-30 10:47:13,837 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:47:13,837 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-30 10:47:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:47:13,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:47:13,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:47:13,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:47:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:47:14,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:47:14,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-09-30 10:47:14,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:47:14,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:47:14,045 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:47:14,045 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. Received shutdown request... [2018-09-30 10:47:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:47:20,805 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:47:20,811 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:47:20,812 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:47:20 BoogieIcfgContainer [2018-09-30 10:47:20,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:47:20,814 INFO L168 Benchmark]: Toolchain (without parser) took 248730.18 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 292.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -48.7 MB). Peak memory consumption was 243.8 MB. Max. memory is 7.1 GB. [2018-09-30 10:47:20,817 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:47:20,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:47:20,818 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:47:20,819 INFO L168 Benchmark]: RCFGBuilder took 518.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:47:20,821 INFO L168 Benchmark]: TraceAbstraction took 248133.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 292.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -69.9 MB). Peak memory consumption was 222.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:47:20,825 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 518.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248133.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 292.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -69.9 MB). Peak memory consumption was 222.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (2773states) and FLOYD_HOARE automaton (currently 57 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (506 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (2773states) and FLOYD_HOARE automaton (currently 57 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (506 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (2773states) and FLOYD_HOARE automaton (currently 57 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (506 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (2773states) and FLOYD_HOARE automaton (currently 57 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (506 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 248.0s OverallTime, 48 OverallIterations, 3 TraceHistogramMax, 219.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1695 SDtfs, 7254 SDslu, 4658 SDs, 0 SdLazy, 31239 SolverSat, 4650 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2094 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 1757 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3515occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.1s AutomataMinimizationTime, 47 MinimizatonAttempts, 11214 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 1002 ConstructedInterpolants, 93 QuantifiedInterpolants, 91273 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1662 ConjunctsInSsa, 358 ConjunctsInUnsatCore, 88 InterpolantComputations, 9 PerfectInterpolantSequences, 97/500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-47-20-840.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-47-20-840.csv Completed graceful shutdown