java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:35:24,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:35:24,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:35:24,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:35:24,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:35:24,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:35:24,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:35:24,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:35:24,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:35:24,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:35:24,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:35:24,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:35:24,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:35:24,380 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:35:24,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:35:24,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:35:24,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:35:24,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:35:24,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:35:24,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:35:24,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:35:24,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:35:24,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:35:24,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:35:24,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:35:24,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:35:24,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:35:24,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:35:24,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:35:24,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:35:24,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:35:24,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:35:24,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:35:24,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:35:24,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:35:24,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:35:24,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:35:24,416 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:35:24,416 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:35:24,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:35:24,417 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:35:24,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:35:24,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:35:24,418 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:35:24,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:35:24,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:35:24,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:35:24,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:35:24,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:35:24,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:35:24,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:35:24,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:35:24,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:35:24,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:35:24,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:35:24,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:35:24,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:35:24,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:35:24,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:35:24,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:24,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:35:24,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:35:24,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:35:24,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:35:24,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:35:24,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:35:24,424 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:35:24,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:35:24,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:35:24,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:35:24,514 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:35:24,514 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:35:24,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-02 11:35:24,515 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-02 11:35:24,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:35:24,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:35:24,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:24,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:35:24,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:35:24,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:24,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:35:24,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:35:24,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:35:24,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... [2018-10-02 11:35:24,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:35:24,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:35:24,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:35:24,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:35:24,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-02 11:35:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-02 11:35:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-02 11:35:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-02 11:35:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-02 11:35:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-02 11:35:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:35:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:35:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-02 11:35:24,744 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-02 11:35:25,289 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:35:25,290 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:25 BoogieIcfgContainer [2018-10-02 11:35:25,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:25,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:25,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:25,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:25,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:24" (1/2) ... [2018-10-02 11:35:25,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43db1b and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:25, skipping insertion in model container [2018-10-02 11:35:25,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:25" (2/2) ... [2018-10-02 11:35:25,299 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-02 11:35:25,309 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:25,318 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 11:35:25,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:25,387 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:25,388 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:25,388 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:25,388 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:25,388 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:25,388 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:25,388 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:25,389 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-02 11:35:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:25,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:25,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:25,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:25,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-02 11:35:25,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:25,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:25,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:25,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:25,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:25,780 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-02 11:35:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:26,649 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-02 11:35:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:26,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:26,666 INFO L225 Difference]: With dead ends: 72 [2018-10-02 11:35:26,666 INFO L226 Difference]: Without dead ends: 70 [2018-10-02 11:35:26,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-02 11:35:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-02 11:35:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-02 11:35:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-02 11:35:26,723 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-02 11:35:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:26,723 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-02 11:35:26,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-02 11:35:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:26,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:26,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:26,726 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:26,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-02 11:35:26,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:26,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:27,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:27,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:27,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:27,061 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-02 11:35:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:27,788 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-02 11:35:27,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:27,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:27,794 INFO L225 Difference]: With dead ends: 81 [2018-10-02 11:35:27,794 INFO L226 Difference]: Without dead ends: 79 [2018-10-02 11:35:27,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-02 11:35:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-02 11:35:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:35:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-02 11:35:27,822 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-02 11:35:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-02 11:35:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-02 11:35:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:27,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:27,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:27,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:27,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-02 11:35:27,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:27,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:27,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:27,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:27,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:27,980 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-02 11:35:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:28,806 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-02 11:35:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:28,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-02 11:35:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:28,812 INFO L225 Difference]: With dead ends: 122 [2018-10-02 11:35:28,812 INFO L226 Difference]: Without dead ends: 120 [2018-10-02 11:35:28,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-02 11:35:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-02 11:35:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 11:35:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-02 11:35:28,831 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-02 11:35:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:28,832 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-02 11:35:28,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-02 11:35:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:28,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:28,834 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:28,834 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:28,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-02 11:35:28,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:28,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:28,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:29,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:29,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:29,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 11:35:29,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:29,360 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-02 11:35:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,100 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-02 11:35:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:30,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-02 11:35:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,102 INFO L225 Difference]: With dead ends: 168 [2018-10-02 11:35:30,102 INFO L226 Difference]: Without dead ends: 121 [2018-10-02 11:35:30,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-02 11:35:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-02 11:35:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-02 11:35:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-02 11:35:30,134 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-02 11:35:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,138 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-02 11:35:30,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-02 11:35:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:30,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,140 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,141 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-02 11:35:30,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:30,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:30,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:30,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-02 11:35:30,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:30,491 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-02 11:35:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:31,186 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-02 11:35:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:31,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 11:35:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:31,189 INFO L225 Difference]: With dead ends: 164 [2018-10-02 11:35:31,189 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 11:35:31,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 11:35:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-02 11:35:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 11:35:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-02 11:35:31,212 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-02 11:35:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:31,212 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-02 11:35:31,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-02 11:35:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:35:31,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:31,214 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:31,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:31,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-02 11:35:31,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:31,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:31,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:31,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:31,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:31,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:31,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-02 11:35:31,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:31,495 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-02 11:35:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:32,073 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-02 11:35:32,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:32,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 11:35:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:32,076 INFO L225 Difference]: With dead ends: 181 [2018-10-02 11:35:32,077 INFO L226 Difference]: Without dead ends: 179 [2018-10-02 11:35:32,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-02 11:35:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-02 11:35:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-02 11:35:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-02 11:35:32,102 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-02 11:35:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:32,103 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-02 11:35:32,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-02 11:35:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:32,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:32,105 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:32,105 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:32,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-02 11:35:32,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:32,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:32,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:32,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:32,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:32,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 11:35:32,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:32,887 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-02 11:35:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:34,006 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-02 11:35:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:34,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-02 11:35:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:34,008 INFO L225 Difference]: With dead ends: 217 [2018-10-02 11:35:34,008 INFO L226 Difference]: Without dead ends: 133 [2018-10-02 11:35:34,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:35:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-02 11:35:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-02 11:35:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-02 11:35:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-02 11:35:34,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-02 11:35:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:34,031 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-02 11:35:34,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-02 11:35:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:34,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:34,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:34,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:34,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-02 11:35:34,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:34,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:34,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:34,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 11:35:34,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:34,449 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-02 11:35:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:36,061 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-02 11:35:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:36,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-02 11:35:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:36,063 INFO L225 Difference]: With dead ends: 194 [2018-10-02 11:35:36,064 INFO L226 Difference]: Without dead ends: 192 [2018-10-02 11:35:36,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-02 11:35:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-02 11:35:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-02 11:35:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-02 11:35:36,107 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-02 11:35:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:36,107 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-02 11:35:36,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-02 11:35:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:36,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:36,108 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:36,109 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:36,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-02 11:35:36,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:36,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:36,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:36,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:36,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 11:35:36,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:36,621 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-02 11:35:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:38,111 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2018-10-02 11:35:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:38,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 11:35:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:38,117 INFO L225 Difference]: With dead ends: 246 [2018-10-02 11:35:38,117 INFO L226 Difference]: Without dead ends: 244 [2018-10-02 11:35:38,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-02 11:35:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 193. [2018-10-02 11:35:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-02 11:35:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2018-10-02 11:35:38,150 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 14 [2018-10-02 11:35:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2018-10-02 11:35:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2018-10-02 11:35:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:38,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:38,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:38,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-02 11:35:38,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:38,250 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:38,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:38,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-10-02 11:35:38,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:38,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 11:35:38,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:38,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:38,501 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 14 states. [2018-10-02 11:35:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:40,533 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2018-10-02 11:35:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:40,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 11:35:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:40,540 INFO L225 Difference]: With dead ends: 288 [2018-10-02 11:35:40,540 INFO L226 Difference]: Without dead ends: 286 [2018-10-02 11:35:40,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:35:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-02 11:35:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-10-02 11:35:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-02 11:35:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2018-10-02 11:35:40,577 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 14 [2018-10-02 11:35:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:40,577 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2018-10-02 11:35:40,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2018-10-02 11:35:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:40,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:40,578 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:40,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:40,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-02 11:35:40,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:40,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:40,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:40,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:40,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:40,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 11:35:40,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:40,834 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand 14 states. [2018-10-02 11:35:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:41,802 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2018-10-02 11:35:41,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:41,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 11:35:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:41,811 INFO L225 Difference]: With dead ends: 314 [2018-10-02 11:35:41,811 INFO L226 Difference]: Without dead ends: 312 [2018-10-02 11:35:41,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-02 11:35:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-02 11:35:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-02 11:35:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 349 transitions. [2018-10-02 11:35:41,858 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 349 transitions. Word has length 14 [2018-10-02 11:35:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:41,858 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 349 transitions. [2018-10-02 11:35:41,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 349 transitions. [2018-10-02 11:35:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:41,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:41,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:41,859 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:41,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-02 11:35:41,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:42,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:42,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:42,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:42,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 11:35:42,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:42,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:42,162 INFO L87 Difference]: Start difference. First operand 243 states and 349 transitions. Second operand 13 states. [2018-10-02 11:35:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:43,140 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2018-10-02 11:35:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:43,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-02 11:35:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:43,143 INFO L225 Difference]: With dead ends: 322 [2018-10-02 11:35:43,143 INFO L226 Difference]: Without dead ends: 320 [2018-10-02 11:35:43,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-02 11:35:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2018-10-02 11:35:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-02 11:35:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2018-10-02 11:35:43,202 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 14 [2018-10-02 11:35:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:43,203 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2018-10-02 11:35:43,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2018-10-02 11:35:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:43,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:43,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:43,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:43,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-02 11:35:43,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:43,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:43,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:43,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:43,338 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:43,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:43,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 11:35:43,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:43,492 INFO L87 Difference]: Start difference. First operand 302 states and 444 transitions. Second operand 14 states. [2018-10-02 11:35:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:44,863 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2018-10-02 11:35:44,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:44,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 11:35:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:44,870 INFO L225 Difference]: With dead ends: 378 [2018-10-02 11:35:44,871 INFO L226 Difference]: Without dead ends: 376 [2018-10-02 11:35:44,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-02 11:35:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 301. [2018-10-02 11:35:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 11:35:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2018-10-02 11:35:44,944 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 14 [2018-10-02 11:35:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:44,944 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2018-10-02 11:35:44,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2018-10-02 11:35:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:44,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:44,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:44,946 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:44,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-02 11:35:44,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:44,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:45,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:45,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:45,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:45,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:45,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 14 [2018-10-02 11:35:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:35:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:35:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:35:45,358 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand 15 states. [2018-10-02 11:35:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:46,844 INFO L93 Difference]: Finished difference Result 395 states and 572 transitions. [2018-10-02 11:35:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:46,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-02 11:35:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:46,846 INFO L225 Difference]: With dead ends: 395 [2018-10-02 11:35:46,847 INFO L226 Difference]: Without dead ends: 393 [2018-10-02 11:35:46,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:35:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-02 11:35:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 312. [2018-10-02 11:35:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-02 11:35:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 459 transitions. [2018-10-02 11:35:46,901 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 459 transitions. Word has length 14 [2018-10-02 11:35:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:46,902 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 459 transitions. [2018-10-02 11:35:46,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:35:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 459 transitions. [2018-10-02 11:35:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:35:46,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:46,903 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:46,903 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:46,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-02 11:35:46,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:47,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:47,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:47,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:47,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:47,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-02 11:35:47,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:47,221 INFO L87 Difference]: Start difference. First operand 312 states and 459 transitions. Second operand 13 states. [2018-10-02 11:35:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:49,265 INFO L93 Difference]: Finished difference Result 383 states and 560 transitions. [2018-10-02 11:35:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:49,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-02 11:35:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:49,268 INFO L225 Difference]: With dead ends: 383 [2018-10-02 11:35:49,268 INFO L226 Difference]: Without dead ends: 381 [2018-10-02 11:35:49,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:35:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-02 11:35:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 328. [2018-10-02 11:35:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-02 11:35:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2018-10-02 11:35:49,327 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 14 [2018-10-02 11:35:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:49,328 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2018-10-02 11:35:49,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2018-10-02 11:35:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:35:49,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:49,329 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:49,329 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:49,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-02 11:35:49,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:49,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:50,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:50,156 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:50,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:50,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:50,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:50,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:35:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:35:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:35:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:50,364 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 16 states. [2018-10-02 11:35:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:51,792 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2018-10-02 11:35:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:35:51,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-02 11:35:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:51,795 INFO L225 Difference]: With dead ends: 429 [2018-10-02 11:35:51,795 INFO L226 Difference]: Without dead ends: 427 [2018-10-02 11:35:51,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:35:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-02 11:35:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 242. [2018-10-02 11:35:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-02 11:35:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2018-10-02 11:35:51,869 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 17 [2018-10-02 11:35:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:51,869 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2018-10-02 11:35:51,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:35:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2018-10-02 11:35:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:35:51,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:51,871 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:51,871 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:51,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:51,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-02 11:35:51,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:51,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:52,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:52,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:52,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:52,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:53,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:53,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:35:53,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:35:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:35:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:53,160 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand 16 states. [2018-10-02 11:35:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:54,601 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2018-10-02 11:35:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:35:54,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-02 11:35:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:54,603 INFO L225 Difference]: With dead ends: 330 [2018-10-02 11:35:54,603 INFO L226 Difference]: Without dead ends: 328 [2018-10-02 11:35:54,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:35:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-02 11:35:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2018-10-02 11:35:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-02 11:35:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2018-10-02 11:35:54,659 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 17 [2018-10-02 11:35:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:54,660 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2018-10-02 11:35:54,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:35:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2018-10-02 11:35:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:35:54,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:54,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:54,661 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:54,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-02 11:35:54,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:54,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:54,757 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-02 11:35:54,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:35:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:35:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:54,874 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand 12 states. [2018-10-02 11:35:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:55,408 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2018-10-02 11:35:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:55,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-02 11:35:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:55,415 INFO L225 Difference]: With dead ends: 271 [2018-10-02 11:35:55,416 INFO L226 Difference]: Without dead ends: 269 [2018-10-02 11:35:55,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-02 11:35:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-10-02 11:35:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-02 11:35:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2018-10-02 11:35:55,491 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 18 [2018-10-02 11:35:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,491 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2018-10-02 11:35:55,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:35:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2018-10-02 11:35:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:35:55,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,492 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,493 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-02 11:35:55,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:55,883 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-02 11:35:56,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:56,020 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand 13 states. [2018-10-02 11:35:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:58,649 INFO L93 Difference]: Finished difference Result 741 states and 1047 transitions. [2018-10-02 11:35:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 11:35:58,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:35:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:58,653 INFO L225 Difference]: With dead ends: 741 [2018-10-02 11:35:58,653 INFO L226 Difference]: Without dead ends: 564 [2018-10-02 11:35:58,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-02 11:35:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-02 11:35:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 341. [2018-10-02 11:35:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-02 11:35:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2018-10-02 11:35:58,779 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 18 [2018-10-02 11:35:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2018-10-02 11:35:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2018-10-02 11:35:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:35:58,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:58,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:58,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:58,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-02 11:35:58,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:59,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:59,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:59,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 11:35:59,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:59,252 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 13 states. [2018-10-02 11:36:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:00,932 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2018-10-02 11:36:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 11:36:00,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:00,935 INFO L225 Difference]: With dead ends: 809 [2018-10-02 11:36:00,935 INFO L226 Difference]: Without dead ends: 470 [2018-10-02 11:36:00,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:36:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-02 11:36:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2018-10-02 11:36:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-02 11:36:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2018-10-02 11:36:01,108 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 18 [2018-10-02 11:36:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:01,109 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2018-10-02 11:36:01,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2018-10-02 11:36:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:01,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:01,110 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:01,110 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:01,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-02 11:36:01,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:01,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:01,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:01,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:01,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:01,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:36:01,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:01,376 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand 13 states. [2018-10-02 11:36:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:03,134 INFO L93 Difference]: Finished difference Result 1106 states and 1568 transitions. [2018-10-02 11:36:03,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:36:03,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:03,139 INFO L225 Difference]: With dead ends: 1106 [2018-10-02 11:36:03,139 INFO L226 Difference]: Without dead ends: 724 [2018-10-02 11:36:03,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:36:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-02 11:36:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 519. [2018-10-02 11:36:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-02 11:36:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 739 transitions. [2018-10-02 11:36:03,291 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 739 transitions. Word has length 18 [2018-10-02 11:36:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:03,291 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 739 transitions. [2018-10-02 11:36:03,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 739 transitions. [2018-10-02 11:36:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:03,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:03,292 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:03,293 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:03,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-02 11:36:03,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:03,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:03,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:03,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:03,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:03,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-02 11:36:03,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:03,593 INFO L87 Difference]: Start difference. First operand 519 states and 739 transitions. Second operand 11 states. [2018-10-02 11:36:04,474 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-02 11:36:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:05,084 INFO L93 Difference]: Finished difference Result 711 states and 1002 transitions. [2018-10-02 11:36:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:36:05,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-02 11:36:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:05,090 INFO L225 Difference]: With dead ends: 711 [2018-10-02 11:36:05,090 INFO L226 Difference]: Without dead ends: 709 [2018-10-02 11:36:05,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:36:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-02 11:36:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 498. [2018-10-02 11:36:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-02 11:36:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2018-10-02 11:36:05,300 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 18 [2018-10-02 11:36:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:05,300 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2018-10-02 11:36:05,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2018-10-02 11:36:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:05,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:05,302 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:05,302 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:05,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-02 11:36:05,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:05,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:05,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:05,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:05,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:05,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-02 11:36:05,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:05,776 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 13 states. [2018-10-02 11:36:06,643 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-02 11:36:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:07,704 INFO L93 Difference]: Finished difference Result 1319 states and 1864 transitions. [2018-10-02 11:36:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:36:07,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:07,707 INFO L225 Difference]: With dead ends: 1319 [2018-10-02 11:36:07,708 INFO L226 Difference]: Without dead ends: 823 [2018-10-02 11:36:07,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:36:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-10-02 11:36:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 566. [2018-10-02 11:36:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-10-02 11:36:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 809 transitions. [2018-10-02 11:36:07,934 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 809 transitions. Word has length 18 [2018-10-02 11:36:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:07,934 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 809 transitions. [2018-10-02 11:36:07,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 809 transitions. [2018-10-02 11:36:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:07,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:07,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:07,936 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:07,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-02 11:36:07,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:07,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:07,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:08,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:08,078 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:08,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:08,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-02 11:36:08,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:08,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:08,236 INFO L87 Difference]: Start difference. First operand 566 states and 809 transitions. Second operand 12 states. [2018-10-02 11:36:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:09,197 INFO L93 Difference]: Finished difference Result 766 states and 1086 transitions. [2018-10-02 11:36:09,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:36:09,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-02 11:36:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:09,200 INFO L225 Difference]: With dead ends: 766 [2018-10-02 11:36:09,200 INFO L226 Difference]: Without dead ends: 764 [2018-10-02 11:36:09,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:36:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-02 11:36:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2018-10-02 11:36:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-02 11:36:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2018-10-02 11:36:09,422 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 18 [2018-10-02 11:36:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:09,422 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2018-10-02 11:36:09,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2018-10-02 11:36:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:09,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:09,423 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:09,424 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:09,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-02 11:36:09,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:09,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:09,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:09,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:09,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:09,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:09,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-02 11:36:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:09,888 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand 13 states. [2018-10-02 11:36:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:12,728 INFO L93 Difference]: Finished difference Result 2095 states and 2968 transitions. [2018-10-02 11:36:12,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 11:36:12,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:12,734 INFO L225 Difference]: With dead ends: 2095 [2018-10-02 11:36:12,734 INFO L226 Difference]: Without dead ends: 1329 [2018-10-02 11:36:12,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-02 11:36:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-02 11:36:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 992. [2018-10-02 11:36:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-02 11:36:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1402 transitions. [2018-10-02 11:36:13,056 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1402 transitions. Word has length 18 [2018-10-02 11:36:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:13,056 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1402 transitions. [2018-10-02 11:36:13,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1402 transitions. [2018-10-02 11:36:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:13,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:13,058 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:13,058 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:13,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-02 11:36:13,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:13,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:13,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:13,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:13,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-02 11:36:13,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:13,497 INFO L87 Difference]: Start difference. First operand 992 states and 1402 transitions. Second operand 11 states. [2018-10-02 11:36:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:14,801 INFO L93 Difference]: Finished difference Result 1291 states and 1819 transitions. [2018-10-02 11:36:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:36:14,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-02 11:36:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:14,806 INFO L225 Difference]: With dead ends: 1291 [2018-10-02 11:36:14,806 INFO L226 Difference]: Without dead ends: 1289 [2018-10-02 11:36:14,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:36:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-02 11:36:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1028. [2018-10-02 11:36:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-02 11:36:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1454 transitions. [2018-10-02 11:36:15,098 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1454 transitions. Word has length 18 [2018-10-02 11:36:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:15,098 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1454 transitions. [2018-10-02 11:36:15,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1454 transitions. [2018-10-02 11:36:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:15,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:15,099 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:15,100 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:15,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-02 11:36:15,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:15,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:15,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:15,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:15,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:15,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:15,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-02 11:36:15,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:15,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:15,357 INFO L87 Difference]: Start difference. First operand 1028 states and 1454 transitions. Second operand 13 states. [2018-10-02 11:36:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:16,934 INFO L93 Difference]: Finished difference Result 2222 states and 3144 transitions. [2018-10-02 11:36:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:36:16,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:16,948 INFO L225 Difference]: With dead ends: 2222 [2018-10-02 11:36:16,948 INFO L226 Difference]: Without dead ends: 1132 [2018-10-02 11:36:16,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:36:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-02 11:36:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 831. [2018-10-02 11:36:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-02 11:36:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1173 transitions. [2018-10-02 11:36:17,238 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1173 transitions. Word has length 18 [2018-10-02 11:36:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:17,238 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1173 transitions. [2018-10-02 11:36:17,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1173 transitions. [2018-10-02 11:36:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:17,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:17,240 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:17,240 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -228224959, now seen corresponding path program 1 times [2018-10-02 11:36:17,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:17,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:17,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:17,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:17,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:36:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:17,525 INFO L87 Difference]: Start difference. First operand 831 states and 1173 transitions. Second operand 13 states. [2018-10-02 11:36:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:19,695 INFO L93 Difference]: Finished difference Result 1989 states and 2785 transitions. [2018-10-02 11:36:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:36:19,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 11:36:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:19,700 INFO L225 Difference]: With dead ends: 1989 [2018-10-02 11:36:19,700 INFO L226 Difference]: Without dead ends: 1130 [2018-10-02 11:36:19,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:36:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-02 11:36:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 806. [2018-10-02 11:36:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-02 11:36:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1135 transitions. [2018-10-02 11:36:19,984 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1135 transitions. Word has length 18 [2018-10-02 11:36:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:19,984 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1135 transitions. [2018-10-02 11:36:19,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1135 transitions. [2018-10-02 11:36:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:19,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:19,985 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:19,986 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:19,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-02 11:36:19,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:19,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:19,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:19,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:19,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:20,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:20,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:20,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:20,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:20,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 11:36:20,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:20,220 INFO L87 Difference]: Start difference. First operand 806 states and 1135 transitions. Second operand 11 states. [2018-10-02 11:36:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:21,502 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2018-10-02 11:36:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:21,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-02 11:36:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:21,507 INFO L225 Difference]: With dead ends: 1022 [2018-10-02 11:36:21,507 INFO L226 Difference]: Without dead ends: 1020 [2018-10-02 11:36:21,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:36:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-10-02 11:36:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2018-10-02 11:36:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-02 11:36:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1182 transitions. [2018-10-02 11:36:21,787 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1182 transitions. Word has length 22 [2018-10-02 11:36:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1182 transitions. [2018-10-02 11:36:21,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1182 transitions. [2018-10-02 11:36:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:21,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:21,789 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:21,789 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-02 11:36:21,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:21,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:21,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:22,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:22,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:22,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:22,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:22,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:22,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 11:36:22,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:36:22,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:36:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:36:22,366 INFO L87 Difference]: Start difference. First operand 838 states and 1182 transitions. Second operand 10 states. [2018-10-02 11:36:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:24,063 INFO L93 Difference]: Finished difference Result 1127 states and 1575 transitions. [2018-10-02 11:36:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:36:24,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-02 11:36:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:24,067 INFO L225 Difference]: With dead ends: 1127 [2018-10-02 11:36:24,067 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 11:36:24,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:36:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 11:36:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2018-10-02 11:36:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-02 11:36:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2018-10-02 11:36:24,354 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 22 [2018-10-02 11:36:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:24,354 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2018-10-02 11:36:24,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:36:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2018-10-02 11:36:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:24,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:24,356 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:24,356 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:24,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash -510719313, now seen corresponding path program 1 times [2018-10-02 11:36:24,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:24,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:24,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:24,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:24,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:25,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:36:25,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:25,118 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand 14 states. [2018-10-02 11:36:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:27,389 INFO L93 Difference]: Finished difference Result 1127 states and 1578 transitions. [2018-10-02 11:36:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:36:27,389 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-10-02 11:36:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:27,394 INFO L225 Difference]: With dead ends: 1127 [2018-10-02 11:36:27,394 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 11:36:27,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=548, Invalid=1432, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:36:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 11:36:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 830. [2018-10-02 11:36:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-02 11:36:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1171 transitions. [2018-10-02 11:36:27,686 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1171 transitions. Word has length 22 [2018-10-02 11:36:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:27,687 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1171 transitions. [2018-10-02 11:36:27,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1171 transitions. [2018-10-02 11:36:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:27,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:27,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:27,689 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-10-02 11:36:27,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:27,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:27,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:27,843 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:27,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:28,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:28,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-02 11:36:28,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:28,030 INFO L87 Difference]: Start difference. First operand 830 states and 1171 transitions. Second operand 15 states. [2018-10-02 11:36:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:29,712 INFO L93 Difference]: Finished difference Result 1072 states and 1499 transitions. [2018-10-02 11:36:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:36:29,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-02 11:36:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:29,717 INFO L225 Difference]: With dead ends: 1072 [2018-10-02 11:36:29,717 INFO L226 Difference]: Without dead ends: 1070 [2018-10-02 11:36:29,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:36:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-10-02 11:36:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 788. [2018-10-02 11:36:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-02 11:36:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1104 transitions. [2018-10-02 11:36:29,999 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1104 transitions. Word has length 22 [2018-10-02 11:36:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:29,999 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1104 transitions. [2018-10-02 11:36:29,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1104 transitions. [2018-10-02 11:36:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:30,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:30,001 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:30,001 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:30,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-10-02 11:36:30,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:30,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:30,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:30,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:30,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:30,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:30,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 11:36:30,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:36:30,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:36:30,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:36:30,326 INFO L87 Difference]: Start difference. First operand 788 states and 1104 transitions. Second operand 10 states. [2018-10-02 11:36:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:31,715 INFO L93 Difference]: Finished difference Result 1025 states and 1426 transitions. [2018-10-02 11:36:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:36:31,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-02 11:36:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:31,719 INFO L225 Difference]: With dead ends: 1025 [2018-10-02 11:36:31,719 INFO L226 Difference]: Without dead ends: 1023 [2018-10-02 11:36:31,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:36:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-02 11:36:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 818. [2018-10-02 11:36:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-02 11:36:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1149 transitions. [2018-10-02 11:36:32,009 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1149 transitions. Word has length 22 [2018-10-02 11:36:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:32,009 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1149 transitions. [2018-10-02 11:36:32,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:36:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1149 transitions. [2018-10-02 11:36:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:36:32,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:32,011 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:32,011 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:32,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-10-02 11:36:32,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:32,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:32,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:32,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:32,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:32,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-02 11:36:32,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:32,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:32,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:32,287 INFO L87 Difference]: Start difference. First operand 818 states and 1149 transitions. Second operand 15 states. [2018-10-02 11:36:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:34,016 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2018-10-02 11:36:34,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:36:34,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-02 11:36:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:34,020 INFO L225 Difference]: With dead ends: 1057 [2018-10-02 11:36:34,020 INFO L226 Difference]: Without dead ends: 1055 [2018-10-02 11:36:34,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:36:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-10-02 11:36:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 770. [2018-10-02 11:36:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-10-02 11:36:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1073 transitions. [2018-10-02 11:36:34,310 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1073 transitions. Word has length 22 [2018-10-02 11:36:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:34,310 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1073 transitions. [2018-10-02 11:36:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1073 transitions. [2018-10-02 11:36:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:36:34,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:34,311 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:34,311 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:34,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-10-02 11:36:34,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:34,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:35,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:35,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:35,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:35,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:35,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:35,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:35,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:35,597 INFO L87 Difference]: Start difference. First operand 770 states and 1073 transitions. Second operand 15 states. [2018-10-02 11:36:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:38,158 INFO L93 Difference]: Finished difference Result 1779 states and 2438 transitions. [2018-10-02 11:36:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 11:36:38,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 11:36:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:38,163 INFO L225 Difference]: With dead ends: 1779 [2018-10-02 11:36:38,163 INFO L226 Difference]: Without dead ends: 1507 [2018-10-02 11:36:38,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1037, Invalid=3655, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:36:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-02 11:36:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1174. [2018-10-02 11:36:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-02 11:36:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1623 transitions. [2018-10-02 11:36:38,619 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1623 transitions. Word has length 25 [2018-10-02 11:36:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:38,619 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1623 transitions. [2018-10-02 11:36:38,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1623 transitions. [2018-10-02 11:36:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:36:38,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:38,621 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:38,621 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:38,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-10-02 11:36:38,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:38,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:38,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:38,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:38,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:38,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:38,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:38,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:38,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:38,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:38,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:38,919 INFO L87 Difference]: Start difference. First operand 1174 states and 1623 transitions. Second operand 15 states. [2018-10-02 11:36:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:41,759 INFO L93 Difference]: Finished difference Result 2685 states and 3700 transitions. [2018-10-02 11:36:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:36:41,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 11:36:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:41,765 INFO L225 Difference]: With dead ends: 2685 [2018-10-02 11:36:41,765 INFO L226 Difference]: Without dead ends: 1652 [2018-10-02 11:36:41,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:36:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-02 11:36:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1212. [2018-10-02 11:36:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-02 11:36:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1681 transitions. [2018-10-02 11:36:42,221 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1681 transitions. Word has length 25 [2018-10-02 11:36:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:42,221 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1681 transitions. [2018-10-02 11:36:42,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1681 transitions. [2018-10-02 11:36:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:36:42,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:42,223 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:42,224 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:42,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-10-02 11:36:42,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:42,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:42,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:42,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:42,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:42,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:42,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:42,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:42,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:42,523 INFO L87 Difference]: Start difference. First operand 1212 states and 1681 transitions. Second operand 15 states. [2018-10-02 11:36:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:45,377 INFO L93 Difference]: Finished difference Result 2130 states and 2907 transitions. [2018-10-02 11:36:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:36:45,378 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 11:36:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:45,385 INFO L225 Difference]: With dead ends: 2130 [2018-10-02 11:36:45,386 INFO L226 Difference]: Without dead ends: 1946 [2018-10-02 11:36:45,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1010, Invalid=3546, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:36:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-10-02 11:36:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1616. [2018-10-02 11:36:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-02 11:36:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2248 transitions. [2018-10-02 11:36:46,028 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2248 transitions. Word has length 25 [2018-10-02 11:36:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:46,029 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2248 transitions. [2018-10-02 11:36:46,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2248 transitions. [2018-10-02 11:36:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:36:46,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:46,031 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:46,031 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:46,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-10-02 11:36:46,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:46,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:46,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:46,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:46,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:46,222 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:46,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 11:36:46,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:46,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:46,368 INFO L87 Difference]: Start difference. First operand 1616 states and 2248 transitions. Second operand 15 states. [2018-10-02 11:36:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:49,390 INFO L93 Difference]: Finished difference Result 3372 states and 4705 transitions. [2018-10-02 11:36:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:36:49,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 11:36:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:49,400 INFO L225 Difference]: With dead ends: 3372 [2018-10-02 11:36:49,400 INFO L226 Difference]: Without dead ends: 2040 [2018-10-02 11:36:49,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:36:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-02 11:36:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1575. [2018-10-02 11:36:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-02 11:36:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2018-10-02 11:36:49,950 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 25 [2018-10-02 11:36:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:49,951 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2018-10-02 11:36:49,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2018-10-02 11:36:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:36:49,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:49,953 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:49,954 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:49,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-10-02 11:36:49,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:49,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:49,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:49,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:49,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:50,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:50,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:50,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:50,205 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:50,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:50,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:50,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:50,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 11:36:50,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:36:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:36:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:36:50,444 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand 20 states. [2018-10-02 11:36:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:57,327 INFO L93 Difference]: Finished difference Result 2646 states and 3763 transitions. [2018-10-02 11:36:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-02 11:36:57,327 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-02 11:36:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:57,335 INFO L225 Difference]: With dead ends: 2646 [2018-10-02 11:36:57,335 INFO L226 Difference]: Without dead ends: 2644 [2018-10-02 11:36:57,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3132, Invalid=9524, Unknown=0, NotChecked=0, Total=12656 [2018-10-02 11:36:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-10-02 11:36:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1833. [2018-10-02 11:36:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-02 11:36:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2576 transitions. [2018-10-02 11:36:58,014 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2576 transitions. Word has length 29 [2018-10-02 11:36:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:58,014 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2576 transitions. [2018-10-02 11:36:58,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:36:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2576 transitions. [2018-10-02 11:36:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:36:58,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:58,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:58,017 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:58,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1030242552, now seen corresponding path program 2 times [2018-10-02 11:36:58,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:58,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:36:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:58,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:58,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:58,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:58,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:58,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:58,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-02 11:36:59,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:36:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:36:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:59,282 INFO L87 Difference]: Start difference. First operand 1833 states and 2576 transitions. Second operand 21 states. [2018-10-02 11:37:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:06,460 INFO L93 Difference]: Finished difference Result 2887 states and 4117 transitions. [2018-10-02 11:37:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-02 11:37:06,461 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-02 11:37:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:06,468 INFO L225 Difference]: With dead ends: 2887 [2018-10-02 11:37:06,468 INFO L226 Difference]: Without dead ends: 2885 [2018-10-02 11:37:06,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3166, Invalid=9716, Unknown=0, NotChecked=0, Total=12882 [2018-10-02 11:37:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-10-02 11:37:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2102. [2018-10-02 11:37:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-10-02 11:37:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2970 transitions. [2018-10-02 11:37:07,202 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2970 transitions. Word has length 29 [2018-10-02 11:37:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:07,202 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2970 transitions. [2018-10-02 11:37:07,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:37:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2970 transitions. [2018-10-02 11:37:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:07,205 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:07,205 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:07,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-10-02 11:37:07,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:07,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:07,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 11:37:07,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:07,374 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:07,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:07,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:07,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:07,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:07,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:37:07,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:37:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:37:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:37:07,841 INFO L87 Difference]: Start difference. First operand 2102 states and 2970 transitions. Second operand 16 states. [2018-10-02 11:37:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:13,386 INFO L93 Difference]: Finished difference Result 6948 states and 9725 transitions. [2018-10-02 11:37:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-02 11:37:13,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-02 11:37:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:13,398 INFO L225 Difference]: With dead ends: 6948 [2018-10-02 11:37:13,398 INFO L226 Difference]: Without dead ends: 4896 [2018-10-02 11:37:13,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-02 11:37:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-10-02 11:37:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 3634. [2018-10-02 11:37:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-10-02 11:37:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5080 transitions. [2018-10-02 11:37:15,029 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5080 transitions. Word has length 33 [2018-10-02 11:37:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:15,030 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 5080 transitions. [2018-10-02 11:37:15,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:37:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5080 transitions. [2018-10-02 11:37:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:15,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:15,033 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:15,033 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:15,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-10-02 11:37:15,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:15,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:15,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:15,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:15,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:15,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:15,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-02 11:37:15,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:15,450 INFO L87 Difference]: Start difference. First operand 3634 states and 5080 transitions. Second operand 18 states. [2018-10-02 11:37:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:22,126 INFO L93 Difference]: Finished difference Result 5436 states and 7576 transitions. [2018-10-02 11:37:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 11:37:22,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-02 11:37:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:22,138 INFO L225 Difference]: With dead ends: 5436 [2018-10-02 11:37:22,138 INFO L226 Difference]: Without dead ends: 5349 [2018-10-02 11:37:22,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1401, Invalid=6609, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:37:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2018-10-02 11:37:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4022. [2018-10-02 11:37:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2018-10-02 11:37:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5648 transitions. [2018-10-02 11:37:23,698 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5648 transitions. Word has length 33 [2018-10-02 11:37:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:23,698 INFO L480 AbstractCegarLoop]: Abstraction has 4022 states and 5648 transitions. [2018-10-02 11:37:23,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5648 transitions. [2018-10-02 11:37:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:23,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:23,701 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:23,702 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:23,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -895180230, now seen corresponding path program 3 times [2018-10-02 11:37:23,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:23,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:23,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:23,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:24,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:24,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:24,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:37:24,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:37:24,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:24,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:25,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:25,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-02 11:37:25,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:37:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:37:25,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:37:25,597 INFO L87 Difference]: Start difference. First operand 4022 states and 5648 transitions. Second operand 22 states. [2018-10-02 11:37:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:37,694 INFO L93 Difference]: Finished difference Result 8032 states and 11417 transitions. [2018-10-02 11:37:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-02 11:37:37,695 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-10-02 11:37:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:37,711 INFO L225 Difference]: With dead ends: 8032 [2018-10-02 11:37:37,711 INFO L226 Difference]: Without dead ends: 7935 [2018-10-02 11:37:37,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8181 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4070, Invalid=17686, Unknown=0, NotChecked=0, Total=21756 [2018-10-02 11:37:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2018-10-02 11:37:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 4327. [2018-10-02 11:37:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2018-10-02 11:37:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 6121 transitions. [2018-10-02 11:37:39,561 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 6121 transitions. Word has length 33 [2018-10-02 11:37:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:39,562 INFO L480 AbstractCegarLoop]: Abstraction has 4327 states and 6121 transitions. [2018-10-02 11:37:39,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:37:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 6121 transitions. [2018-10-02 11:37:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:39,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:39,565 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:39,565 INFO L423 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:39,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1250173630, now seen corresponding path program 1 times [2018-10-02 11:37:39,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:39,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:39,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:39,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:39,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-02 11:37:39,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:37:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:37:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:39,916 INFO L87 Difference]: Start difference. First operand 4327 states and 6121 transitions. Second operand 19 states. [2018-10-02 11:37:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:48,439 INFO L93 Difference]: Finished difference Result 9177 states and 12958 transitions. [2018-10-02 11:37:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-02 11:37:48,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-02 11:37:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:48,451 INFO L225 Difference]: With dead ends: 9177 [2018-10-02 11:37:48,452 INFO L226 Difference]: Without dead ends: 5991 [2018-10-02 11:37:48,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4514 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2969, Invalid=11311, Unknown=0, NotChecked=0, Total=14280 [2018-10-02 11:37:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-10-02 11:37:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4147. [2018-10-02 11:37:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4147 states. [2018-10-02 11:37:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5817 transitions. [2018-10-02 11:37:50,273 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5817 transitions. Word has length 33 [2018-10-02 11:37:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:50,273 INFO L480 AbstractCegarLoop]: Abstraction has 4147 states and 5817 transitions. [2018-10-02 11:37:50,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:37:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5817 transitions. [2018-10-02 11:37:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:50,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:50,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:50,277 INFO L423 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:50,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1810158453, now seen corresponding path program 2 times [2018-10-02 11:37:50,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:50,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:50,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:50,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:50,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:50,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:50,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:50,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-10-02 11:37:50,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:50,782 INFO L87 Difference]: Start difference. First operand 4147 states and 5817 transitions. Second operand 18 states. [2018-10-02 11:37:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:56,256 INFO L93 Difference]: Finished difference Result 5255 states and 7327 transitions. [2018-10-02 11:37:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:37:56,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-02 11:37:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:56,264 INFO L225 Difference]: With dead ends: 5255 [2018-10-02 11:37:56,264 INFO L226 Difference]: Without dead ends: 5253 [2018-10-02 11:37:56,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:37:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-10-02 11:37:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4447. [2018-10-02 11:37:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2018-10-02 11:37:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6228 transitions. [2018-10-02 11:37:58,312 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6228 transitions. Word has length 33 [2018-10-02 11:37:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:58,312 INFO L480 AbstractCegarLoop]: Abstraction has 4447 states and 6228 transitions. [2018-10-02 11:37:58,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6228 transitions. [2018-10-02 11:37:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:37:58,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:58,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:58,315 INFO L423 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:58,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash -667748710, now seen corresponding path program 1 times [2018-10-02 11:37:58,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:58,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:58,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:58,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:58,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-02 11:37:58,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:58,690 INFO L87 Difference]: Start difference. First operand 4447 states and 6228 transitions. Second operand 18 states. [2018-10-02 11:38:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:09,132 INFO L93 Difference]: Finished difference Result 7721 states and 10805 transitions. [2018-10-02 11:38:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-02 11:38:09,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-02 11:38:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:09,142 INFO L225 Difference]: With dead ends: 7721 [2018-10-02 11:38:09,142 INFO L226 Difference]: Without dead ends: 7719 [2018-10-02 11:38:09,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1278, Invalid=8228, Unknown=0, NotChecked=0, Total=9506 [2018-10-02 11:38:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2018-10-02 11:38:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 5438. [2018-10-02 11:38:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2018-10-02 11:38:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 7651 transitions. [2018-10-02 11:38:11,637 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 7651 transitions. Word has length 33 [2018-10-02 11:38:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:11,638 INFO L480 AbstractCegarLoop]: Abstraction has 5438 states and 7651 transitions. [2018-10-02 11:38:11,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:38:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 7651 transitions. [2018-10-02 11:38:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:38:11,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:11,641 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:11,641 INFO L423 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:11,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1146614399, now seen corresponding path program 2 times [2018-10-02 11:38:11,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:11,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:11,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 11:38:11,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:11,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:38:11,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:38:11,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:11,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:11,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:11,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:38:11,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:38:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:38:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:38:11,908 INFO L87 Difference]: Start difference. First operand 5438 states and 7651 transitions. Second operand 16 states. [2018-10-02 11:38:15,509 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-02 11:38:15,943 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-02 11:38:16,277 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-02 11:38:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:21,784 INFO L93 Difference]: Finished difference Result 15976 states and 22278 transitions. [2018-10-02 11:38:21,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-02 11:38:21,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-02 11:38:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:21,798 INFO L225 Difference]: With dead ends: 15976 [2018-10-02 11:38:21,798 INFO L226 Difference]: Without dead ends: 10483 [2018-10-02 11:38:21,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6466 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-02 11:38:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2018-10-02 11:38:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 8111. [2018-10-02 11:38:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-10-02 11:38:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 11260 transitions. [2018-10-02 11:38:25,548 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 11260 transitions. Word has length 33 [2018-10-02 11:38:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:25,549 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 11260 transitions. [2018-10-02 11:38:25,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:38:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 11260 transitions. [2018-10-02 11:38:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:38:25,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:25,553 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:25,553 INFO L423 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:25,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1449531796, now seen corresponding path program 1 times [2018-10-02 11:38:25,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:25,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:25,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:25,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:25,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:25,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:25,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:25,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:25,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-10-02 11:38:25,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:38:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:38:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:38:25,977 INFO L87 Difference]: Start difference. First operand 8111 states and 11260 transitions. Second operand 19 states. [2018-10-02 11:38:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:34,954 INFO L93 Difference]: Finished difference Result 10277 states and 14246 transitions. [2018-10-02 11:38:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 11:38:34,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-02 11:38:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:34,970 INFO L225 Difference]: With dead ends: 10277 [2018-10-02 11:38:34,970 INFO L226 Difference]: Without dead ends: 10275 [2018-10-02 11:38:34,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=4424, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:38:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-10-02 11:38:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 8291. [2018-10-02 11:38:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-10-02 11:38:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 11531 transitions. [2018-10-02 11:38:38,927 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 11531 transitions. Word has length 33 [2018-10-02 11:38:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:38,928 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 11531 transitions. [2018-10-02 11:38:38,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:38:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 11531 transitions. [2018-10-02 11:38:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:38:38,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:38,933 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:38,933 INFO L423 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:38,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480992, now seen corresponding path program 1 times [2018-10-02 11:38:38,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:39,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:39,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:39,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:39,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-02 11:38:39,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:38:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:38:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:38:39,275 INFO L87 Difference]: Start difference. First operand 8291 states and 11531 transitions. Second operand 19 states. [2018-10-02 11:38:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:49,740 INFO L93 Difference]: Finished difference Result 16294 states and 22694 transitions. [2018-10-02 11:38:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-02 11:38:49,740 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-02 11:38:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:49,752 INFO L225 Difference]: With dead ends: 16294 [2018-10-02 11:38:49,752 INFO L226 Difference]: Without dead ends: 9999 [2018-10-02 11:38:49,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2859, Invalid=11183, Unknown=0, NotChecked=0, Total=14042 [2018-10-02 11:38:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2018-10-02 11:38:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8241. [2018-10-02 11:38:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8241 states. [2018-10-02 11:38:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 11466 transitions. [2018-10-02 11:38:53,741 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 11466 transitions. Word has length 33 [2018-10-02 11:38:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:53,742 INFO L480 AbstractCegarLoop]: Abstraction has 8241 states and 11466 transitions. [2018-10-02 11:38:53,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:38:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 11466 transitions. [2018-10-02 11:38:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:38:53,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:53,746 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:53,746 INFO L423 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:53,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 610357864, now seen corresponding path program 3 times [2018-10-02 11:38:53,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:53,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:54,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:54,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:38:54,078 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:38:54,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:54,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2018-10-02 11:38:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:38:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:38:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:38:54,201 INFO L87 Difference]: Start difference. First operand 8241 states and 11466 transitions. Second operand 21 states. [2018-10-02 11:39:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:14,464 INFO L93 Difference]: Finished difference Result 25684 states and 35500 transitions. [2018-10-02 11:39:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-02 11:39:14,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-02 11:39:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:14,485 INFO L225 Difference]: With dead ends: 25684 [2018-10-02 11:39:14,485 INFO L226 Difference]: Without dead ends: 16698 [2018-10-02 11:39:14,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6678, Invalid=35142, Unknown=0, NotChecked=0, Total=41820 [2018-10-02 11:39:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-10-02 11:39:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 10011. [2018-10-02 11:39:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2018-10-02 11:39:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13930 transitions. [2018-10-02 11:39:19,561 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13930 transitions. Word has length 33 [2018-10-02 11:39:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:19,561 INFO L480 AbstractCegarLoop]: Abstraction has 10011 states and 13930 transitions. [2018-10-02 11:39:19,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:39:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13930 transitions. [2018-10-02 11:39:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:39:19,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:19,566 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:19,566 INFO L423 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:19,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash 690693469, now seen corresponding path program 1 times [2018-10-02 11:39:19,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:19,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:19,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:19,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:19,709 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:19,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:39:19,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:19,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-10-02 11:39:19,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:39:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:39:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:39:19,944 INFO L87 Difference]: Start difference. First operand 10011 states and 13930 transitions. Second operand 21 states. [2018-10-02 11:39:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:32,173 INFO L93 Difference]: Finished difference Result 12668 states and 17557 transitions. [2018-10-02 11:39:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 11:39:32,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-02 11:39:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:32,188 INFO L225 Difference]: With dead ends: 12668 [2018-10-02 11:39:32,189 INFO L226 Difference]: Without dead ends: 12586 [2018-10-02 11:39:32,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=841, Invalid=6131, Unknown=0, NotChecked=0, Total=6972 [2018-10-02 11:39:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12586 states. Received shutdown request... [2018-10-02 11:39:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12586 to 10468. [2018-10-02 11:39:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10468 states. [2018-10-02 11:39:37,315 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:37,321 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:37,321 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:37 BoogieIcfgContainer [2018-10-02 11:39:37,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:37,322 INFO L168 Benchmark]: Toolchain (without parser) took 252743.28 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -526.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-02 11:39:37,323 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:37,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:37,323 INFO L168 Benchmark]: Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:37,324 INFO L168 Benchmark]: RCFGBuilder took 632.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:37,324 INFO L168 Benchmark]: TraceAbstraction took 252030.32 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-02 11:39:37,327 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 632.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252030.32 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.9 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 251.9s OverallTime, 51 OverallIterations, 4 TraceHistogramMax, 185.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3758 SDtfs, 10438 SDslu, 7427 SDs, 0 SdLazy, 52271 SolverSat, 14023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 1041 SyntacticMatches, 11 SemanticMatches, 2805 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 85743 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10011occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 41.4s AutomataMinimizationTime, 51 MinimizatonAttempts, 32101 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 2009 ConstructedInterpolants, 32 QuantifiedInterpolants, 222893 SizeOfPredicates, 797 NumberOfNonLiveVariables, 14213 ConjunctsInSsa, 1503 ConjunctsInUnsatCore, 99 InterpolantComputations, 9 PerfectInterpolantSequences, 199/778 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_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-37-343.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-37-343.csv Completed graceful shutdown