java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:03:34,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:34,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:34,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:34,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:34,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:34,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:34,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:34,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:34,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:34,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:34,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:34,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:34,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:34,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:34,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:34,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:34,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:34,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:34,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:34,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:34,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:34,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:34,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:34,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:34,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:34,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:34,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:34,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:34,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:34,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:34,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:34,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:34,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:34,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:34,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:34,607 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:03:34,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:34,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:34,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:34,634 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:34,635 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:34,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:34,635 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:34,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:34,636 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:34,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:34,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:34,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:34,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:34,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:34,638 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:34,638 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:34,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:34,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:34,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:34,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:34,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:34,641 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:34,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:34,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:34,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:34,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:34,642 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:34,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:34,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:34,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:34,642 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:34,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:34,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:34,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:34,733 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:34,733 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:34,734 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 12:03:34,734 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-02 12:03:34,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:34,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:34,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:34,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:34,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:34,811 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,824 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:34,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:34,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:34,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:34,848 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,848 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,849 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,850 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,854 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,857 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,858 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 12:03:34" (1/1) ... [2018-10-02 12:03:34,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:34,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:34,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:34,861 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:34,862 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 12:03:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-02 12:03:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-02 12:03:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-02 12:03:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-02 12:03:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-02 12:03:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-02 12:03:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:03:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:03:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-02 12:03:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-02 12:03:35,559 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:03:35,560 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:35 BoogieIcfgContainer [2018-10-02 12:03:35,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:35,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:35,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:35,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:35,565 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 12:03:34" (1/2) ... [2018-10-02 12:03:35,567 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 12:03:35, skipping insertion in model container [2018-10-02 12:03:35,567 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 12:03:35" (2/2) ... [2018-10-02 12:03:35,569 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-02 12:03:35,579 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:35,588 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 12:03:35,644 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:35,645 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:35,645 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:35,645 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:35,645 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:35,645 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:35,645 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:35,646 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:35,646 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-02 12:03:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:35,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:35,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:35,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:35,686 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-02 12:03:35,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:35,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:35,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:36,144 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 12:03:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:36,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:36,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:36,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:36,166 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-02 12:03:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:38,321 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-02 12:03:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:38,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 12:03:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:38,341 INFO L225 Difference]: With dead ends: 72 [2018-10-02 12:03:38,342 INFO L226 Difference]: Without dead ends: 70 [2018-10-02 12:03:38,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-02 12:03:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-02 12:03:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-02 12:03:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-02 12:03:38,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-02 12:03:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:38,402 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-02 12:03:38,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-02 12:03:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:38,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:38,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:38,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:38,404 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-02 12:03:38,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:38,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:38,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:38,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:38,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:38,521 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 12:03:38,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:38,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:38,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:38,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:38,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:38,524 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-02 12:03:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:39,432 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-02 12:03:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:03:39,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 12:03:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:39,440 INFO L225 Difference]: With dead ends: 81 [2018-10-02 12:03:39,441 INFO L226 Difference]: Without dead ends: 79 [2018-10-02 12:03:39,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-02 12:03:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-02 12:03:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 12:03:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-02 12:03:39,455 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-02 12:03:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:39,455 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-02 12:03:39,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-02 12:03:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:39,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:39,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:39,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:39,458 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-02 12:03:39,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:39,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:39,603 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 12:03:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:03:39,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:39,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:39,605 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-02 12:03:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:41,782 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-02 12:03:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:03:41,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-02 12:03:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:41,789 INFO L225 Difference]: With dead ends: 122 [2018-10-02 12:03:41,790 INFO L226 Difference]: Without dead ends: 120 [2018-10-02 12:03:41,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-02 12:03:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-02 12:03:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 12:03:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-02 12:03:41,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-02 12:03:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:41,808 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-02 12:03:41,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-02 12:03:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:03:41,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:41,810 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:41,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:41,811 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-02 12:03:41,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:41,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:41,937 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 12:03:41,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:41,938 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 12:03:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:42,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:42,288 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 12:03:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:03:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 12:03:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:03:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:03:42,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:42,313 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-02 12:03:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:44,114 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-02 12:03:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:03:44,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-02 12:03:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:44,116 INFO L225 Difference]: With dead ends: 168 [2018-10-02 12:03:44,116 INFO L226 Difference]: Without dead ends: 121 [2018-10-02 12:03:44,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:03:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-02 12:03:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-02 12:03:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-02 12:03:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-02 12:03:44,137 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-02 12:03:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:44,137 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-02 12:03:44,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:03:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-02 12:03:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:03:44,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:44,139 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:44,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:44,140 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-02 12:03:44,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:44,251 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 12:03:44,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:44,252 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 12:03:44,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:44,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:44,418 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 12:03:44,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:44,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-02 12:03:44,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:03:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:03:44,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:44,440 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-02 12:03:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:46,440 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-02 12:03:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:03:46,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 12:03:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:46,443 INFO L225 Difference]: With dead ends: 164 [2018-10-02 12:03:46,444 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 12:03:46,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 12:03:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-02 12:03:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 12:03:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-02 12:03:46,464 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-02 12:03:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:46,465 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-02 12:03:46,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:03:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-02 12:03:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:03:46,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:46,467 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:46,467 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:46,467 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-02 12:03:46,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:46,563 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 12:03:46,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:46,563 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 12:03:46,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:46,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:46,723 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 12:03:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-02 12:03:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:03:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:03:46,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:46,745 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-02 12:03:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:48,887 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-02 12:03:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:03:48,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-02 12:03:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:48,891 INFO L225 Difference]: With dead ends: 181 [2018-10-02 12:03:48,891 INFO L226 Difference]: Without dead ends: 179 [2018-10-02 12:03:48,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:03:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-02 12:03:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-02 12:03:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-02 12:03:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-02 12:03:48,914 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-02 12:03:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:48,914 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-02 12:03:48,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:03:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-02 12:03:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:03:48,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:48,917 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:48,917 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:48,917 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-02 12:03:48,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:48,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:48,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:49,019 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 12:03:49,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:49,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:03:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:49,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:49,122 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 12:03:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:03:49,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 12:03:49,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:03:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:03:49,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:49,144 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-02 12:03:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:50,907 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-02 12:03:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:03:50,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-02 12:03:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:50,910 INFO L225 Difference]: With dead ends: 217 [2018-10-02 12:03:50,910 INFO L226 Difference]: Without dead ends: 133 [2018-10-02 12:03:50,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-02 12:03:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-02 12:03:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-02 12:03:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-02 12:03:50,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-02 12:03:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:50,934 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-02 12:03:50,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:03:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-02 12:03:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:03:50,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:50,935 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:50,936 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:50,936 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-02 12:03:50,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:50,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:51,047 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 12:03:51,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:51,048 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 12:03:51,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:51,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:51,190 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 12:03:51,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:51,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 12:03:51,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:03:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:03:51,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:51,213 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-02 12:03:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:55,162 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-02 12:03:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:03:55,170 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-02 12:03:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:55,171 INFO L225 Difference]: With dead ends: 194 [2018-10-02 12:03:55,172 INFO L226 Difference]: Without dead ends: 192 [2018-10-02 12:03:55,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:03:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-02 12:03:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-02 12:03:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-02 12:03:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-02 12:03:55,214 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-02 12:03:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:55,214 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-02 12:03:55,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:03:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-02 12:03:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:03:55,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:55,217 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:55,217 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:55,217 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-02 12:03:55,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:55,346 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 12:03:55,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:03:55,346 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 12:03:55,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:55,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:03:55,634 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 12:03:55,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:03:55,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 12:03:55,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:03:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:03:55,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:55,666 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-02 12:03:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:59,901 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2018-10-02 12:03:59,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:03:59,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:03:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:59,906 INFO L225 Difference]: With dead ends: 246 [2018-10-02 12:03:59,906 INFO L226 Difference]: Without dead ends: 244 [2018-10-02 12:03:59,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:03:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-02 12:03:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 193. [2018-10-02 12:03:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-02 12:03:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2018-10-02 12:03:59,938 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 14 [2018-10-02 12:03:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:59,938 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2018-10-02 12:03:59,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:03:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2018-10-02 12:03:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:03:59,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:59,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:59,940 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:59,941 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-02 12:03:59,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:59,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:00,135 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 12:04:00,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:00,138 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 12:04:00,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:00,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:00,551 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 12:04:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 12:04:00,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:00,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:00,573 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 14 states. [2018-10-02 12:04:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:05,770 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2018-10-02 12:04:05,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:05,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:04:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:05,776 INFO L225 Difference]: With dead ends: 288 [2018-10-02 12:04:05,777 INFO L226 Difference]: Without dead ends: 286 [2018-10-02 12:04:05,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:04:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-02 12:04:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-10-02 12:04:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-02 12:04:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2018-10-02 12:04:05,809 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 14 [2018-10-02 12:04:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:05,809 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2018-10-02 12:04:05,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2018-10-02 12:04:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:05,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:05,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:05,810 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:05,811 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-02 12:04:05,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:05,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:05,902 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 12:04:05,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:05,903 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 12:04:05,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:05,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:06,024 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 12:04:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 12:04:06,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:06,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:06,047 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand 14 states. [2018-10-02 12:04:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:09,328 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2018-10-02 12:04:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:04:09,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:04:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:09,334 INFO L225 Difference]: With dead ends: 314 [2018-10-02 12:04:09,334 INFO L226 Difference]: Without dead ends: 312 [2018-10-02 12:04:09,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:04:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-02 12:04:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-02 12:04:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-02 12:04:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 349 transitions. [2018-10-02 12:04:09,372 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 349 transitions. Word has length 14 [2018-10-02 12:04:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:09,372 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 349 transitions. [2018-10-02 12:04:09,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 349 transitions. [2018-10-02 12:04:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:09,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:09,373 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:09,374 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:09,374 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-02 12:04:09,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:09,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:09,530 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 12:04:09,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:09,530 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 12:04:09,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:09,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:09,645 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 12:04:09,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:09,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-02 12:04:09,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:09,668 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:09,668 INFO L87 Difference]: Start difference. First operand 243 states and 349 transitions. Second operand 13 states. [2018-10-02 12:04:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:11,894 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2018-10-02 12:04:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:11,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-02 12:04:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:11,897 INFO L225 Difference]: With dead ends: 322 [2018-10-02 12:04:11,897 INFO L226 Difference]: Without dead ends: 320 [2018-10-02 12:04:11,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:04:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-02 12:04:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2018-10-02 12:04:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-02 12:04:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2018-10-02 12:04:11,955 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 14 [2018-10-02 12:04:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2018-10-02 12:04:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2018-10-02 12:04:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:11,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:11,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:11,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:11,958 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-02 12:04:11,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:12,112 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 12:04:12,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:12,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:04:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:12,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:12,273 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 12:04:12,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:12,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 12:04:12,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:04:12,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:04:12,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:12,296 INFO L87 Difference]: Start difference. First operand 302 states and 444 transitions. Second operand 14 states. [2018-10-02 12:04:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:16,444 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2018-10-02 12:04:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:04:16,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-02 12:04:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:16,448 INFO L225 Difference]: With dead ends: 378 [2018-10-02 12:04:16,448 INFO L226 Difference]: Without dead ends: 376 [2018-10-02 12:04:16,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-02 12:04:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 301. [2018-10-02 12:04:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 12:04:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2018-10-02 12:04:16,498 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 14 [2018-10-02 12:04:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:16,499 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2018-10-02 12:04:16,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:04:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2018-10-02 12:04:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:16,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:16,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:16,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:16,500 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-02 12:04:16,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:16,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:16,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:16,577 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 12:04:16,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:16,578 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 12:04:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:16,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:16,758 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 12:04:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2018-10-02 12:04:16,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:04:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:04:16,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:16,782 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand 16 states. [2018-10-02 12:04:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:21,472 INFO L93 Difference]: Finished difference Result 395 states and 572 transitions. [2018-10-02 12:04:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:21,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-10-02 12:04:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:21,475 INFO L225 Difference]: With dead ends: 395 [2018-10-02 12:04:21,475 INFO L226 Difference]: Without dead ends: 393 [2018-10-02 12:04:21,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime [2018-10-02 12:04:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-02 12:04:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 312. [2018-10-02 12:04:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-02 12:04:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 459 transitions. [2018-10-02 12:04:21,524 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 459 transitions. Word has length 14 [2018-10-02 12:04:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:21,525 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 459 transitions. [2018-10-02 12:04:21,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:04:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 459 transitions. [2018-10-02 12:04:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:04:21,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:21,526 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:21,526 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:21,526 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-02 12:04:21,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:21,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:21,617 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 12:04:21,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:21,617 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:04:21,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:21,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:21,792 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 12:04:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2018-10-02 12:04:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:04:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:04:21,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:21,815 INFO L87 Difference]: Start difference. First operand 312 states and 459 transitions. Second operand 15 states. [2018-10-02 12:04:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:25,957 INFO L93 Difference]: Finished difference Result 383 states and 560 transitions. [2018-10-02 12:04:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:04:25,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-02 12:04:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:25,960 INFO L225 Difference]: With dead ends: 383 [2018-10-02 12:04:25,960 INFO L226 Difference]: Without dead ends: 381 [2018-10-02 12:04:25,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:04:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-02 12:04:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 328. [2018-10-02 12:04:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-02 12:04:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2018-10-02 12:04:26,026 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 14 [2018-10-02 12:04:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:26,026 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2018-10-02 12:04:26,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:04:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2018-10-02 12:04:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:04:26,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:26,027 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:26,028 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:26,028 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:26,028 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-02 12:04:26,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:26,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:26,824 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 12:04:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:26,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:04:26,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:26,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:26,990 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 12:04:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:27,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:04:27,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:04:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:04:27,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:27,013 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 16 states. [2018-10-02 12:04:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:30,606 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2018-10-02 12:04:30,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:04:30,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-02 12:04:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:30,609 INFO L225 Difference]: With dead ends: 429 [2018-10-02 12:04:30,609 INFO L226 Difference]: Without dead ends: 427 [2018-10-02 12:04:30,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime [2018-10-02 12:04:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-02 12:04:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 242. [2018-10-02 12:04:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-02 12:04:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2018-10-02 12:04:30,676 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 17 [2018-10-02 12:04:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:30,677 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2018-10-02 12:04:30,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:04:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2018-10-02 12:04:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:04:30,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:30,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:30,678 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:30,679 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-02 12:04:30,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:30,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:30,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:31,177 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 12:04:31,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:31,177 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 12:04:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:31,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:31,303 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 12:04:31,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:31,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 12:04:31,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:04:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:04:31,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:31,326 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand 16 states. [2018-10-02 12:04:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:35,008 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2018-10-02 12:04:35,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:04:35,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-02 12:04:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:35,010 INFO L225 Difference]: With dead ends: 330 [2018-10-02 12:04:35,010 INFO L226 Difference]: Without dead ends: 328 [2018-10-02 12:04:35,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:04:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-02 12:04:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2018-10-02 12:04:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-02 12:04:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2018-10-02 12:04:35,067 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 17 [2018-10-02 12:04:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:35,067 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2018-10-02 12:04:35,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:04:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2018-10-02 12:04:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:35,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:35,068 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 12:04:35,069 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:35,069 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-02 12:04:35,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:35,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:35,160 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 12:04:35,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:35,161 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 12:04:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:35,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:35,277 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 12:04:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-02 12:04:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:35,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:35,298 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand 13 states. [2018-10-02 12:04:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:37,356 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2018-10-02 12:04:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:04:37,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:04:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:37,358 INFO L225 Difference]: With dead ends: 271 [2018-10-02 12:04:37,358 INFO L226 Difference]: Without dead ends: 269 [2018-10-02 12:04:37,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-02 12:04:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-10-02 12:04:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-02 12:04:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2018-10-02 12:04:37,417 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 18 [2018-10-02 12:04:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2018-10-02 12:04:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2018-10-02 12:04:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:37,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:37,419 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 12:04:37,419 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:37,420 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-02 12:04:37,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:37,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:38,267 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 12:04:38,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:38,267 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) [2018-10-02 12:04:38,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:04:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:38,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:38,587 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 12:04:38,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:38,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-02 12:04:38,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:38,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:38,609 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand 13 states. [2018-10-02 12:04:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:44,994 INFO L93 Difference]: Finished difference Result 741 states and 1047 transitions. [2018-10-02 12:04:44,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 12:04:44,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:04:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:44,997 INFO L225 Difference]: With dead ends: 741 [2018-10-02 12:04:44,997 INFO L226 Difference]: Without dead ends: 564 [2018-10-02 12:04:44,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime [2018-10-02 12:04:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-02 12:04:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 341. [2018-10-02 12:04:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-02 12:04:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2018-10-02 12:04:45,120 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 18 [2018-10-02 12:04:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:45,121 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2018-10-02 12:04:45,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2018-10-02 12:04:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:45,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:45,122 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 12:04:45,122 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:45,122 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-02 12:04:45,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:45,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:45,243 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 12:04:45,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:45,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:04:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:45,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:45,442 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 12:04:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-02 12:04:45,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:45,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:45,465 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 13 states. [2018-10-02 12:04:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:49,084 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2018-10-02 12:04:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 12:04:49,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:04:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:49,087 INFO L225 Difference]: With dead ends: 809 [2018-10-02 12:04:49,087 INFO L226 Difference]: Without dead ends: 470 [2018-10-02 12:04:49,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:04:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-02 12:04:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2018-10-02 12:04:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-02 12:04:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2018-10-02 12:04:49,230 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 18 [2018-10-02 12:04:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:49,230 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2018-10-02 12:04:49,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2018-10-02 12:04:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:49,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:49,231 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 12:04:49,231 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:49,232 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-02 12:04:49,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:49,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:49,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:49,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:49,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:49,396 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 12:04:49,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:49,397 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 12:04:49,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:49,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:49,512 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 12:04:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:49,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:04:49,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:49,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:49,534 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand 13 states. [2018-10-02 12:04:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:55,341 INFO L93 Difference]: Finished difference Result 1106 states and 1568 transitions. [2018-10-02 12:04:55,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 12:04:55,341 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:04:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:55,345 INFO L225 Difference]: With dead ends: 1106 [2018-10-02 12:04:55,345 INFO L226 Difference]: Without dead ends: 724 [2018-10-02 12:04:55,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:04:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-02 12:04:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 519. [2018-10-02 12:04:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-02 12:04:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 739 transitions. [2018-10-02 12:04:55,557 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 739 transitions. Word has length 18 [2018-10-02 12:04:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:55,558 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 739 transitions. [2018-10-02 12:04:55,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:04:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 739 transitions. [2018-10-02 12:04:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:55,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:55,559 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 12:04:55,559 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:55,559 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-02 12:04:55,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:55,662 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 12:04:55,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:55,663 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 12:04:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:55,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:55,773 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 12:04:55,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:04:55,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-02 12:04:55,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:04:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:04:55,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:55,796 INFO L87 Difference]: Start difference. First operand 519 states and 739 transitions. Second operand 11 states. [2018-10-02 12:04:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:58,097 INFO L93 Difference]: Finished difference Result 711 states and 1002 transitions. [2018-10-02 12:04:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:04:58,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-02 12:04:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:58,101 INFO L225 Difference]: With dead ends: 711 [2018-10-02 12:04:58,101 INFO L226 Difference]: Without dead ends: 709 [2018-10-02 12:04:58,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:04:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-02 12:04:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 498. [2018-10-02 12:04:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-02 12:04:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2018-10-02 12:04:58,277 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 18 [2018-10-02 12:04:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:58,277 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2018-10-02 12:04:58,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:04:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2018-10-02 12:04:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:04:58,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:58,279 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 12:04:58,279 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:58,279 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-02 12:04:58,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:58,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:58,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:58,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 12:04:58,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:04:58,598 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 12:04:58,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:58,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:04:58,733 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 12:04:58,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:04:58,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-02 12:04:58,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:04:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:04:58,774 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:58,774 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 13 states. [2018-10-02 12:05:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:02,491 INFO L93 Difference]: Finished difference Result 1319 states and 1864 transitions. [2018-10-02 12:05:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:05:02,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:05:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:02,495 INFO L225 Difference]: With dead ends: 1319 [2018-10-02 12:05:02,495 INFO L226 Difference]: Without dead ends: 823 [2018-10-02 12:05:02,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime [2018-10-02 12:05:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-10-02 12:05:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 566. [2018-10-02 12:05:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-10-02 12:05:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 809 transitions. [2018-10-02 12:05:02,713 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 809 transitions. Word has length 18 [2018-10-02 12:05:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:02,714 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 809 transitions. [2018-10-02 12:05:02,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 809 transitions. [2018-10-02 12:05:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:02,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:02,715 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 12:05:02,715 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:02,716 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-02 12:05:02,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:02,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:02,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:02,887 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 12:05:02,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:02,888 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 12:05:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:02,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:03,019 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 12:05:03,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:03,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-02 12:05:03,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:05:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:05:03,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:03,040 INFO L87 Difference]: Start difference. First operand 566 states and 809 transitions. Second operand 13 states. [2018-10-02 12:05:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:05,318 INFO L93 Difference]: Finished difference Result 766 states and 1086 transitions. [2018-10-02 12:05:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:05:05,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:05:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:05,321 INFO L225 Difference]: With dead ends: 766 [2018-10-02 12:05:05,322 INFO L226 Difference]: Without dead ends: 764 [2018-10-02 12:05:05,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:05:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-02 12:05:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2018-10-02 12:05:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-02 12:05:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2018-10-02 12:05:05,512 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 18 [2018-10-02 12:05:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2018-10-02 12:05:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2018-10-02 12:05:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:05,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:05,514 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 12:05:05,514 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:05,514 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-02 12:05:05,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:05,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:05,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:05,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:05,772 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 12:05:05,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:05,773 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 12:05:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:05,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:05,996 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 12:05:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:05:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-02 12:05:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:05:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:05:06,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:06,019 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand 13 states. [2018-10-02 12:05:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:13,274 INFO L93 Difference]: Finished difference Result 2095 states and 2968 transitions. [2018-10-02 12:05:13,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 12:05:13,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:05:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:13,280 INFO L225 Difference]: With dead ends: 2095 [2018-10-02 12:05:13,281 INFO L226 Difference]: Without dead ends: 1329 [2018-10-02 12:05:13,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime [2018-10-02 12:05:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-02 12:05:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 992. [2018-10-02 12:05:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-02 12:05:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1402 transitions. [2018-10-02 12:05:13,610 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1402 transitions. Word has length 18 [2018-10-02 12:05:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:13,611 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1402 transitions. [2018-10-02 12:05:13,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1402 transitions. [2018-10-02 12:05:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:13,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:13,612 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 12:05:13,612 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:13,612 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-02 12:05:13,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:13,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:13,703 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 12:05:13,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:13,703 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 12:05:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:13,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:13,853 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 12:05:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:13,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-02 12:05:13,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:05:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:05:13,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:13,876 INFO L87 Difference]: Start difference. First operand 992 states and 1402 transitions. Second operand 11 states. [2018-10-02 12:05:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:16,590 INFO L93 Difference]: Finished difference Result 1291 states and 1819 transitions. [2018-10-02 12:05:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:05:16,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-02 12:05:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:16,594 INFO L225 Difference]: With dead ends: 1291 [2018-10-02 12:05:16,595 INFO L226 Difference]: Without dead ends: 1289 [2018-10-02 12:05:16,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:05:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-02 12:05:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1028. [2018-10-02 12:05:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-02 12:05:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1454 transitions. [2018-10-02 12:05:16,927 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1454 transitions. Word has length 18 [2018-10-02 12:05:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:16,927 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1454 transitions. [2018-10-02 12:05:16,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:05:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1454 transitions. [2018-10-02 12:05:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:16,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:16,929 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 12:05:16,929 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:16,929 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-02 12:05:16,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:16,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:16,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:16,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:16,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:17,067 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 12:05:17,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:17,068 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 12:05:17,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:17,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:17,181 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 12:05:17,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:05:17,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-02 12:05:17,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:05:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:05:17,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:17,203 INFO L87 Difference]: Start difference. First operand 1028 states and 1454 transitions. Second operand 13 states. [2018-10-02 12:05:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:20,995 INFO L93 Difference]: Finished difference Result 2222 states and 3144 transitions. [2018-10-02 12:05:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:05:20,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:05:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:21,003 INFO L225 Difference]: With dead ends: 2222 [2018-10-02 12:05:21,004 INFO L226 Difference]: Without dead ends: 1132 [2018-10-02 12:05:21,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-02 12:05:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 831. [2018-10-02 12:05:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-02 12:05:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1173 transitions. [2018-10-02 12:05:21,352 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1173 transitions. Word has length 18 [2018-10-02 12:05:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:21,352 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1173 transitions. [2018-10-02 12:05:21,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1173 transitions. [2018-10-02 12:05:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:05:21,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:21,354 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 12:05:21,354 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:21,354 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash -228224959, now seen corresponding path program 1 times [2018-10-02 12:05:21,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:21,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:21,507 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 12:05:21,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:21,507 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 12:05:21,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:21,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:21,675 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 12:05:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:05:21,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:05:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:05:21,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:21,698 INFO L87 Difference]: Start difference. First operand 831 states and 1173 transitions. Second operand 13 states. [2018-10-02 12:05:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:27,163 INFO L93 Difference]: Finished difference Result 1989 states and 2785 transitions. [2018-10-02 12:05:27,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 12:05:27,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-02 12:05:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:27,168 INFO L225 Difference]: With dead ends: 1989 [2018-10-02 12:05:27,168 INFO L226 Difference]: Without dead ends: 1130 [2018-10-02 12:05:27,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime [2018-10-02 12:05:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-02 12:05:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 806. [2018-10-02 12:05:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-02 12:05:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1135 transitions. [2018-10-02 12:05:27,430 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1135 transitions. Word has length 18 [2018-10-02 12:05:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:27,431 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1135 transitions. [2018-10-02 12:05:27,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:05:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1135 transitions. [2018-10-02 12:05:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:27,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:27,432 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 12:05:27,432 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:27,432 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-02 12:05:27,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:27,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:27,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:27,548 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 12:05:27,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:27,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:27,691 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 12:05:27,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-02 12:05:27,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:05:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:05:27,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:27,714 INFO L87 Difference]: Start difference. First operand 806 states and 1135 transitions. Second operand 12 states. [2018-10-02 12:05:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:31,313 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2018-10-02 12:05:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:05:31,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-02 12:05:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:31,318 INFO L225 Difference]: With dead ends: 1022 [2018-10-02 12:05:31,318 INFO L226 Difference]: Without dead ends: 1020 [2018-10-02 12:05:31,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:05:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-10-02 12:05:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2018-10-02 12:05:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-02 12:05:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1182 transitions. [2018-10-02 12:05:31,609 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1182 transitions. Word has length 22 [2018-10-02 12:05:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:31,609 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1182 transitions. [2018-10-02 12:05:31,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:05:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1182 transitions. [2018-10-02 12:05:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:31,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:31,610 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 12:05:31,611 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:31,611 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:31,611 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-02 12:05:31,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:31,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:31,899 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 12:05:31,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:31,900 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 12:05:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:31,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:05:32,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 12:05:32,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:05:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:05:32,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:32,523 INFO L87 Difference]: Start difference. First operand 838 states and 1182 transitions. Second operand 10 states. [2018-10-02 12:05:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:36,691 INFO L93 Difference]: Finished difference Result 1127 states and 1575 transitions. [2018-10-02 12:05:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:05:36,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-02 12:05:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:36,696 INFO L225 Difference]: With dead ends: 1127 [2018-10-02 12:05:36,696 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 12:05:36,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.3s impTime [2018-10-02 12:05:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 12:05:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2018-10-02 12:05:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-02 12:05:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2018-10-02 12:05:37,020 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 22 [2018-10-02 12:05:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:37,021 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2018-10-02 12:05:37,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:05:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2018-10-02 12:05:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:37,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:37,022 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 12:05:37,023 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:37,023 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -510719313, now seen corresponding path program 1 times [2018-10-02 12:05:37,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:37,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:37,386 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 12:05:37,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:37,387 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 12:05:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:37,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:37,512 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 12:05:37,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:37,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 12:05:37,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:05:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:05:37,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:37,534 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand 14 states. [2018-10-02 12:05:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:42,449 INFO L93 Difference]: Finished difference Result 1127 states and 1578 transitions. [2018-10-02 12:05:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:05:42,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-10-02 12:05:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:42,453 INFO L225 Difference]: With dead ends: 1127 [2018-10-02 12:05:42,454 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 12:05:42,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:05:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 12:05:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 830. [2018-10-02 12:05:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-02 12:05:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1171 transitions. [2018-10-02 12:05:42,755 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1171 transitions. Word has length 22 [2018-10-02 12:05:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:42,756 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1171 transitions. [2018-10-02 12:05:42,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:05:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1171 transitions. [2018-10-02 12:05:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:42,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:42,757 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 12:05:42,758 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:42,758 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-10-02 12:05:42,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:42,882 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 12:05:42,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:42,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 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 12:05:42,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:42,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:43,056 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 12:05:43,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:43,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-02 12:05:43,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:43,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:43,080 INFO L87 Difference]: Start difference. First operand 830 states and 1171 transitions. Second operand 15 states. [2018-10-02 12:05:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:47,738 INFO L93 Difference]: Finished difference Result 1072 states and 1499 transitions. [2018-10-02 12:05:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:05:47,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-02 12:05:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:47,742 INFO L225 Difference]: With dead ends: 1072 [2018-10-02 12:05:47,742 INFO L226 Difference]: Without dead ends: 1070 [2018-10-02 12:05:47,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:05:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-10-02 12:05:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 788. [2018-10-02 12:05:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-02 12:05:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1104 transitions. [2018-10-02 12:05:48,044 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1104 transitions. Word has length 22 [2018-10-02 12:05:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:48,044 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1104 transitions. [2018-10-02 12:05:48,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1104 transitions. [2018-10-02 12:05:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:48,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:48,046 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 12:05:48,046 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:48,046 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-10-02 12:05:48,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:48,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:48,256 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 12:05:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:48,257 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 12:05:48,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:48,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:48,357 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 12:05:48,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-02 12:05:48,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:05:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:05:48,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:48,379 INFO L87 Difference]: Start difference. First operand 788 states and 1104 transitions. Second operand 10 states. [2018-10-02 12:05:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:51,799 INFO L93 Difference]: Finished difference Result 1025 states and 1426 transitions. [2018-10-02 12:05:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:05:51,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-02 12:05:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:51,803 INFO L225 Difference]: With dead ends: 1025 [2018-10-02 12:05:51,803 INFO L226 Difference]: Without dead ends: 1023 [2018-10-02 12:05:51,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:05:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-02 12:05:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 818. [2018-10-02 12:05:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-02 12:05:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1149 transitions. [2018-10-02 12:05:52,107 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1149 transitions. Word has length 22 [2018-10-02 12:05:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:52,108 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1149 transitions. [2018-10-02 12:05:52,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:05:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1149 transitions. [2018-10-02 12:05:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:05:52,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:52,109 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 12:05:52,109 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:52,109 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-10-02 12:05:52,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:52,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:52,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:52,337 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 12:05:52,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:52,337 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 12:05:52,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:52,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:52,469 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 12:05:52,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-02 12:05:52,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:52,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:52,492 INFO L87 Difference]: Start difference. First operand 818 states and 1149 transitions. Second operand 15 states. [2018-10-02 12:05:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:57,118 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2018-10-02 12:05:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:05:57,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-02 12:05:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:57,122 INFO L225 Difference]: With dead ends: 1057 [2018-10-02 12:05:57,122 INFO L226 Difference]: Without dead ends: 1055 [2018-10-02 12:05:57,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:05:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-10-02 12:05:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 770. [2018-10-02 12:05:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-10-02 12:05:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1073 transitions. [2018-10-02 12:05:57,427 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1073 transitions. Word has length 22 [2018-10-02 12:05:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:57,427 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1073 transitions. [2018-10-02 12:05:57,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:05:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1073 transitions. [2018-10-02 12:05:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:05:57,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:57,428 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 12:05:57,428 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:57,428 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-10-02 12:05:57,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:58,488 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 12:05:58,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:05:58,488 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 12:05:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:58,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:05:58,642 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 12:05:58,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:05:58,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:05:58,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:05:58,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:05:58,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:58,663 INFO L87 Difference]: Start difference. First operand 770 states and 1073 transitions. Second operand 15 states. [2018-10-02 12:06:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:04,394 INFO L93 Difference]: Finished difference Result 1779 states and 2438 transitions. [2018-10-02 12:06:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 12:06:04,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 12:06:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:04,399 INFO L225 Difference]: With dead ends: 1779 [2018-10-02 12:06:04,399 INFO L226 Difference]: Without dead ends: 1507 [2018-10-02 12:06:04,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.1s impTime [2018-10-02 12:06:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-02 12:06:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1174. [2018-10-02 12:06:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-02 12:06:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1623 transitions. [2018-10-02 12:06:04,835 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1623 transitions. Word has length 25 [2018-10-02 12:06:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:04,836 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1623 transitions. [2018-10-02 12:06:04,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1623 transitions. [2018-10-02 12:06:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:06:04,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:04,837 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 12:06:04,837 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:04,837 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-10-02 12:06:04,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:04,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:04,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:04,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,068 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 12:06:05,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:05,071 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 12:06:05,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:05,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:05,199 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 12:06:05,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:05,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:06:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:06:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:06:05,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:05,222 INFO L87 Difference]: Start difference. First operand 1174 states and 1623 transitions. Second operand 15 states. [2018-10-02 12:06:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:11,551 INFO L93 Difference]: Finished difference Result 2685 states and 3700 transitions. [2018-10-02 12:06:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:06:11,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 12:06:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:11,557 INFO L225 Difference]: With dead ends: 2685 [2018-10-02 12:06:11,557 INFO L226 Difference]: Without dead ends: 1652 [2018-10-02 12:06:11,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:06:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-02 12:06:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1212. [2018-10-02 12:06:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-02 12:06:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1681 transitions. [2018-10-02 12:06:12,058 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1681 transitions. Word has length 25 [2018-10-02 12:06:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:12,059 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1681 transitions. [2018-10-02 12:06:12,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1681 transitions. [2018-10-02 12:06:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:06:12,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:12,061 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 12:06:12,061 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:12,061 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-10-02 12:06:12,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:12,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:12,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 12:06:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:12,228 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 12:06:12,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:12,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:12,369 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 12:06:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:12,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:06:12,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:06:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:06:12,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:12,392 INFO L87 Difference]: Start difference. First operand 1212 states and 1681 transitions. Second operand 15 states. [2018-10-02 12:06:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:18,651 INFO L93 Difference]: Finished difference Result 2130 states and 2907 transitions. [2018-10-02 12:06:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:06:18,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 12:06:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:18,659 INFO L225 Difference]: With dead ends: 2130 [2018-10-02 12:06:18,659 INFO L226 Difference]: Without dead ends: 1946 [2018-10-02 12:06:18,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:06:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-10-02 12:06:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1616. [2018-10-02 12:06:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-02 12:06:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2248 transitions. [2018-10-02 12:06:19,310 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2248 transitions. Word has length 25 [2018-10-02 12:06:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:19,310 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2248 transitions. [2018-10-02 12:06:19,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2248 transitions. [2018-10-02 12:06:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:06:19,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:19,312 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 12:06:19,313 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:19,313 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-10-02 12:06:19,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:19,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:19,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:19,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:19,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:19,425 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 12:06:19,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:19,426 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 12:06:19,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:19,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:19,564 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 12:06:19,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:19,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-02 12:06:19,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:06:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:06:19,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:19,585 INFO L87 Difference]: Start difference. First operand 1616 states and 2248 transitions. Second operand 15 states. [2018-10-02 12:06:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:25,688 INFO L93 Difference]: Finished difference Result 3372 states and 4705 transitions. [2018-10-02 12:06:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:06:25,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-02 12:06:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:25,698 INFO L225 Difference]: With dead ends: 3372 [2018-10-02 12:06:25,698 INFO L226 Difference]: Without dead ends: 2040 [2018-10-02 12:06:25,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:06:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-02 12:06:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1575. [2018-10-02 12:06:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-02 12:06:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2018-10-02 12:06:26,452 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 25 [2018-10-02 12:06:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:26,453 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2018-10-02 12:06:26,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:06:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2018-10-02 12:06:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:06:26,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:26,455 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 12:06:26,456 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:26,456 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-10-02 12:06:26,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:26,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:26,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:26,806 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 12:06:26,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:26,807 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 12:06:26,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:06:26,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:06:26,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:06:26,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:27,084 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 12:06:27,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:27,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 12:06:27,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:06:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:06:27,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:27,105 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand 20 states. [2018-10-02 12:06:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:42,033 INFO L93 Difference]: Finished difference Result 2646 states and 3763 transitions. [2018-10-02 12:06:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-02 12:06:42,033 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-02 12:06:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:42,040 INFO L225 Difference]: With dead ends: 2646 [2018-10-02 12:06:42,040 INFO L226 Difference]: Without dead ends: 2644 [2018-10-02 12:06:42,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.1s impTime [2018-10-02 12:06:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-10-02 12:06:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1833. [2018-10-02 12:06:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-02 12:06:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2576 transitions. [2018-10-02 12:06:42,747 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2576 transitions. Word has length 29 [2018-10-02 12:06:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:42,747 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2576 transitions. [2018-10-02 12:06:42,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:06:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2576 transitions. [2018-10-02 12:06:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:06:42,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:42,749 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 12:06:42,749 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:42,749 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1030242552, now seen corresponding path program 2 times [2018-10-02 12:06:42,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:42,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:42,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:06:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:42,955 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 12:06:42,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:42,955 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 12:06:42,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:06:43,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:06:43,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:06:43,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:43,182 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 12:06:43,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:43,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-02 12:06:43,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 12:06:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 12:06:43,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:43,205 INFO L87 Difference]: Start difference. First operand 1833 states and 2576 transitions. Second operand 21 states. [2018-10-02 12:06:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:56,860 INFO L93 Difference]: Finished difference Result 2887 states and 4117 transitions. [2018-10-02 12:06:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-02 12:06:56,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-02 12:06:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:56,867 INFO L225 Difference]: With dead ends: 2887 [2018-10-02 12:06:56,867 INFO L226 Difference]: Without dead ends: 2885 [2018-10-02 12:06:56,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.0s impTime [2018-10-02 12:06:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-10-02 12:06:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2102. [2018-10-02 12:06:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-10-02 12:06:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2970 transitions. [2018-10-02 12:06:57,708 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2970 transitions. Word has length 29 [2018-10-02 12:06:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:57,709 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2970 transitions. [2018-10-02 12:06:57,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 12:06:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2970 transitions. [2018-10-02 12:06:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 12:06:57,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:57,711 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 12:06:57,712 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:57,712 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-10-02 12:06:57,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:57,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:06:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:58,079 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 12:06:58,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:58,080 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 12:06:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:06:58,140 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:06:58,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:06:58,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:58,536 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 12:06:58,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:58,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 12:06:58,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:06:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:06:58,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:58,558 INFO L87 Difference]: Start difference. First operand 2102 states and 2970 transitions. Second operand 16 states. [2018-10-02 12:07:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:08,423 INFO L93 Difference]: Finished difference Result 6948 states and 9725 transitions. [2018-10-02 12:07:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-02 12:07:08,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-02 12:07:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:08,434 INFO L225 Difference]: With dead ends: 6948 [2018-10-02 12:07:08,434 INFO L226 Difference]: Without dead ends: 4896 [2018-10-02 12:07:08,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.3s impTime [2018-10-02 12:07:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-10-02 12:07:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 3634. [2018-10-02 12:07:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-10-02 12:07:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5080 transitions. [2018-10-02 12:07:10,007 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5080 transitions. Word has length 33 [2018-10-02 12:07:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:10,007 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 5080 transitions. [2018-10-02 12:07:10,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:07:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5080 transitions. [2018-10-02 12:07:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 12:07:10,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:10,010 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 12:07:10,010 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:10,011 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-10-02 12:07:10,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:10,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:10,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:07:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:10,208 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 12:07:10,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:10,208 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 12:07:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:10,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:10,420 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 12:07:10,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-02 12:07:10,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:07:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:07:10,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:10,442 INFO L87 Difference]: Start difference. First operand 3634 states and 5080 transitions. Second operand 18 states. [2018-10-02 12:07:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:24,552 INFO L93 Difference]: Finished difference Result 5436 states and 7576 transitions. [2018-10-02 12:07:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 12:07:24,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-02 12:07:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:24,566 INFO L225 Difference]: With dead ends: 5436 [2018-10-02 12:07:24,566 INFO L226 Difference]: Without dead ends: 5349 [2018-10-02 12:07:24,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime [2018-10-02 12:07:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2018-10-02 12:07:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4022. [2018-10-02 12:07:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2018-10-02 12:07:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5648 transitions. [2018-10-02 12:07:26,169 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5648 transitions. Word has length 33 [2018-10-02 12:07:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:26,169 INFO L480 AbstractCegarLoop]: Abstraction has 4022 states and 5648 transitions. [2018-10-02 12:07:26,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:07:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5648 transitions. [2018-10-02 12:07:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 12:07:26,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:26,173 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 12:07:26,173 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:26,173 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -895180230, now seen corresponding path program 3 times [2018-10-02 12:07:26,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:26,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:26,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:26,344 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 12:07:26,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:26,344 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 12:07:26,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:07:26,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 12:07:26,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:07:26,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:27,670 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 12:07:27,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:27,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-02 12:07:27,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 12:07:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 12:07:27,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:27,691 INFO L87 Difference]: Start difference. First operand 4022 states and 5648 transitions. Second operand 22 states. Received shutdown request... [2018-10-02 12:07:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-02 12:07:41,452 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:07:41,460 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:07:41,460 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:07:41 BoogieIcfgContainer [2018-10-02 12:07:41,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:07:41,564 INFO L168 Benchmark]: Toolchain (without parser) took 246776.67 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 890.2 MB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -927.7 MB). Peak memory consumption was 242.7 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:41,567 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:07:41,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.11 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 12:07:41,568 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 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 12:07:41,568 INFO L168 Benchmark]: RCFGBuilder took 698.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:41,569 INFO L168 Benchmark]: TraceAbstraction took 245899.73 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 374.3 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -153.2 MB). Peak memory consumption was 221.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:41,581 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.11 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 24.90 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 698.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245899.73 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 374.3 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -153.2 MB). Peak memory consumption was 221.2 MB. 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 BasicCegarLoop was constructing difference of abstraction (4022states) and FLOYD_HOARE automaton (currently 88 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (4022states) and FLOYD_HOARE automaton (currently 88 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while BasicCegarLoop was constructing difference of abstraction (4022states) and FLOYD_HOARE automaton (currently 88 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while BasicCegarLoop was constructing difference of abstraction (4022states) and FLOYD_HOARE automaton (currently 88 states, 22 states before enhancement), while ReachableStatesComputation was computing reachable states (1137 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 245.8s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 213.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2941 SDtfs, 7536 SDslu, 5429 SDs, 0 SdLazy, 34289 SolverSat, 9766 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2648 GetRequests, 731 SyntacticMatches, 5 SemanticMatches, 1912 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4022occurred in iteration=42, 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: 11.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 10761 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1580 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 1497 ConstructedInterpolants, 28 QuantifiedInterpolants, 137351 SizeOfPredicates, 599 NumberOfNonLiveVariables, 10709 ConjunctsInSsa, 1120 ConjunctsInUnsatCore, 83 InterpolantComputations, 9 PerfectInterpolantSequences, 113/462 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-07-41-597.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-07-41-597.csv Completed graceful shutdown