java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:42:08,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:42:08,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:42:08,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:42:08,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:42:08,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:42:08,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:42:08,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:42:08,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:42:08,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:42:08,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:42:08,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:42:08,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:42:08,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:42:08,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:42:08,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:42:08,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:42:08,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:42:08,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:42:08,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:42:08,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:42:08,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:42:08,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:42:08,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:42:08,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:42:08,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:42:08,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:42:08,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:42:08,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:42:08,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:42:08,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:42:08,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:42:08,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:42:08,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:42:08,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:42:08,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:42:08,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:42:08,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:42:08,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:42:08,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:42:08,616 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:42:08,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:42:08,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:42:08,618 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:42:08,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:42:08,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:42:08,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:42:08,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:42:08,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:42:08,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:42:08,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:42:08,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:42:08,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:42:08,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:42:08,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:42:08,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:42:08,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:42:08,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:42:08,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:42:08,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:42:08,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:42:08,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:42:08,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:42:08,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:42:08,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:42:08,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:42:08,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:42:08,623 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:42:08,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:42:08,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:42:08,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:42:08,692 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:42:08,693 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:42:08,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-10-04 12:42:08,694 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-04 12:42:08,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:42:08,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:42:08,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:08,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:42:08,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:42:08,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,797 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:42:08,797 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:42:08,798 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:42:08,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:08,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:42:08,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:42:08,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:42:08,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... [2018-10-04 12:42:08,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:42:08,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:42:08,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:42:08,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:42:08,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:42:08,902 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:42:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:42:08,902 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:09,330 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:09,331 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:09 BoogieIcfgContainer [2018-10-04 12:42:09,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:09,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:09,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:09,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:09,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:08" (1/2) ... [2018-10-04 12:42:09,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9eb6b7 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:09, skipping insertion in model container [2018-10-04 12:42:09,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:09" (2/2) ... [2018-10-04 12:42:09,341 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-04 12:42:09,352 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:09,366 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 12:42:09,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:09,411 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:09,412 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:09,412 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:09,412 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:09,412 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:09,412 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:09,413 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:09,413 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:42:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:42:09,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:42:09,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,444 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-04 12:42:09,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:09,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:09,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:09,675 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-04 12:42:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,167 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-04 12:42:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:42:10,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:42:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,185 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:42:10,185 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:42:10,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:42:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:42:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-04 12:42:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:42:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-04 12:42:10,230 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-04 12:42:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,231 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-04 12:42:10,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-04 12:42:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:42:10,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:42:10,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,233 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-04 12:42:10,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:10,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:10,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:10,343 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,343 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-04 12:42:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,667 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-04 12:42:10,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:42:10,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:42:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,671 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:42:10,671 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:42:10,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:42:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:42:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-04 12:42:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:42:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-04 12:42:10,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-04 12:42:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,681 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-04 12:42:10,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-04 12:42:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:10,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:10,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,685 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-04 12:42:10,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:10,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:10,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:10,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:10,779 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,780 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-04 12:42:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:11,559 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-04 12:42:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:42:11,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:42:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:11,562 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:42:11,563 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:42:11,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 12:42:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:42:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-04 12:42:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:42:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-04 12:42:11,583 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-04 12:42:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:11,585 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-04 12:42:11,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-04 12:42:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:11,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:11,586 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:11,587 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:11,587 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-04 12:42:11,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:11,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:11,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:11,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:11,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:11,738 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-04 12:42:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,025 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-04 12:42:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:42:12,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:42:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,027 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:42:12,027 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 12:42:12,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:42:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 12:42:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-04 12:42:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:42:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-04 12:42:12,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-04 12:42:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,041 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-04 12:42:12,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-04 12:42:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:12,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:12,042 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:12,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-04 12:42:12,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:12,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:12,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:42:12,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:12,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,342 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-04 12:42:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,398 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-04 12:42:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:42:13,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-04 12:42:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,401 INFO L225 Difference]: With dead ends: 107 [2018-10-04 12:42:13,401 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 12:42:13,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 12 [2018-10-04 12:42:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 12:42:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-04 12:42:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:42:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-04 12:42:13,417 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-04 12:42:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,418 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-04 12:42:13,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-04 12:42:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:13,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:13,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:13,420 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-04 12:42:13,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:13,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:13,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:13,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:13,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,530 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-04 12:42:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,930 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-04 12:42:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:13,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:42:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,932 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:42:13,932 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:42:13,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 12:42:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:42:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-04 12:42:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:42:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-04 12:42:13,950 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-04 12:42:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,950 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-04 12:42:13,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-04 12:42:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:13,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:13,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:13,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-04 12:42:13,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:13,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:14,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:14,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:14,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:14,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:14,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 12:42:14,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:14,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:14,258 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-04 12:42:15,525 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,508 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-04 12:42:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:42:16,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 12:42:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,513 INFO L225 Difference]: With dead ends: 150 [2018-10-04 12:42:16,513 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 12:42:16,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 12 [2018-10-04 12:42:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 12:42:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-04 12:42:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 12:42:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-04 12:42:16,539 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-04 12:42:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:16,540 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-04 12:42:16,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-04 12:42:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:16,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:16,541 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:16,541 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:16,542 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-04 12:42:16,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:16,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:16,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:16,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-04 12:42:16,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:16,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:16,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,916 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-04 12:42:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:18,123 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-04 12:42:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:18,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 12:42:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:18,127 INFO L225 Difference]: With dead ends: 137 [2018-10-04 12:42:18,127 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:42:18,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 13 [2018-10-04 12:42:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:42:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-04 12:42:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 12:42:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-04 12:42:18,157 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-04 12:42:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,157 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-04 12:42:18,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-04 12:42:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:18,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:18,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:18,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:18,159 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-04 12:42:18,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:18,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:18,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-10-04 12:42:18,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:18,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,404 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-10-04 12:42:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:20,444 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-04 12:42:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:42:20,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-04 12:42:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:20,446 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:42:20,446 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 12:42:20,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 15 [2018-10-04 12:42:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 12:42:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-04 12:42:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 12:42:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-04 12:42:20,486 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-04 12:42:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:20,486 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-04 12:42:20,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-04 12:42:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:20,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:20,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:20,490 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:20,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-04 12:42:20,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:20,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:20,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:20,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:20,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:20,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:42:20,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:42:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:42:20,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:20,841 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-10-04 12:42:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:21,513 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-04 12:42:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:21,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-10-04 12:42:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:21,517 INFO L225 Difference]: With dead ends: 246 [2018-10-04 12:42:21,517 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 12:42:21,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 12:42:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 12:42:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-04 12:42:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 12:42:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-04 12:42:21,554 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-04 12:42:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:21,555 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-04 12:42:21,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:42:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-04 12:42:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:21,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:21,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:21,556 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:21,557 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-04 12:42:21,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:21,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:21,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:21,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:21,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:42:21,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:21,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:21,754 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-04 12:42:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,158 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-04 12:42:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:42:22,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,161 INFO L225 Difference]: With dead ends: 252 [2018-10-04 12:42:22,161 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 12:42:22,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 12:42:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 12:42:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-04 12:42:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 12:42:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-04 12:42:22,195 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-04 12:42:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,195 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-04 12:42:22,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-04 12:42:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:22,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,196 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,196 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-04 12:42:22,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:22,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:22,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:22,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 12:42:22,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:42:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:42:22,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:22,403 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-04 12:42:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,915 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-04 12:42:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:22,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-04 12:42:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,918 INFO L225 Difference]: With dead ends: 260 [2018-10-04 12:42:22,918 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 12:42:22,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 12:42:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 12:42:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-04 12:42:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-04 12:42:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-04 12:42:22,954 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-04 12:42:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,954 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-04 12:42:22,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:42:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-04 12:42:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:22,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,956 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-04 12:42:22,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:23,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:23,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:23,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,030 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-04 12:42:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,487 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-04 12:42:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:23,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,492 INFO L225 Difference]: With dead ends: 316 [2018-10-04 12:42:23,492 INFO L226 Difference]: Without dead ends: 314 [2018-10-04 12:42:23,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:42:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-04 12:42:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-04 12:42:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 12:42:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-04 12:42:23,534 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-04 12:42:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,534 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-04 12:42:23,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-04 12:42:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:42:23,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:23,535 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-04 12:42:23,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:23,608 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) [2018-10-04 12:42:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:23,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:23,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:42:23,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:23,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,677 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-04 12:42:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:24,004 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-04 12:42:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:42:24,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:42:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:24,008 INFO L225 Difference]: With dead ends: 428 [2018-10-04 12:42:24,008 INFO L226 Difference]: Without dead ends: 426 [2018-10-04 12:42:24,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 12:42:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-04 12:42:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-04 12:42:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-04 12:42:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-04 12:42:24,090 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-04 12:42:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:24,090 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-04 12:42:24,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-04 12:42:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:24,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:24,091 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:24,092 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:24,092 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-04 12:42:24,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:24,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:24,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:24,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:24,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:24,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:24,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 12:42:24,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:42:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:42:24,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:24,291 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-04 12:42:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,111 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-04 12:42:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:42:25,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 12:42:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,115 INFO L225 Difference]: With dead ends: 466 [2018-10-04 12:42:25,115 INFO L226 Difference]: Without dead ends: 464 [2018-10-04 12:42:25,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 13 [2018-10-04 12:42:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-04 12:42:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-04 12:42:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-04 12:42:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-04 12:42:25,182 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-04 12:42:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,182 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-04 12:42:25,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:42:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-04 12:42:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:25,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,183 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-04 12:42:25,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:25,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:25,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:25,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:25,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:25,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-04 12:42:25,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:25,478 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,478 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-04 12:42:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:28,122 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-04 12:42:28,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:42:28,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-04 12:42:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:28,125 INFO L225 Difference]: With dead ends: 859 [2018-10-04 12:42:28,125 INFO L226 Difference]: Without dead ends: 509 [2018-10-04 12:42:28,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 19 [2018-10-04 12:42:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-04 12:42:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-04 12:42:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-04 12:42:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-04 12:42:28,194 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-04 12:42:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,195 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-04 12:42:28,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-04 12:42:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:28,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:28,196 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,196 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-04 12:42:28,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:28,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:28,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:42:28,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:28,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:28,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:28,283 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-04 12:42:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:28,824 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-04 12:42:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:28,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 12:42:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:28,827 INFO L225 Difference]: With dead ends: 481 [2018-10-04 12:42:28,828 INFO L226 Difference]: Without dead ends: 479 [2018-10-04 12:42:28,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 16 [2018-10-04 12:42:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-04 12:42:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-04 12:42:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-04 12:42:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-04 12:42:28,902 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-04 12:42:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,903 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-04 12:42:28,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-04 12:42:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:42:28,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,904 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:28,904 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,904 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-04 12:42:28,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:28,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:28,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:29,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:29,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:29,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:29,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 12:42:29,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:29,128 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:29,128 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-04 12:42:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:29,493 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= product_end0 (+ product_begin0 1)))) (and (and .cse0 (exists ((v_product_begin1_17 Int)) (and (<= (* 2 product_end0) (+ product_begin0 v_product_begin1_17 1)) (<= v_product_begin1_17 (+ product_begin0 1))))) (not (and .cse0 (<= (* 2 product_end0) (+ (* 2 product_begin0) 2)))))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:371) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:249) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:301) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-04 12:42:29,498 INFO L168 Benchmark]: Toolchain (without parser) took 20745.67 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 110.6 MB). Free memory was 1.5 GB in the beginning and 986.4 MB in the end (delta: 478.1 MB). Peak memory consumption was 588.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:29,500 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-04 12:42:29,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.02 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-04 12:42:29,503 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 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-04 12:42:29,503 INFO L168 Benchmark]: RCFGBuilder took 504.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:29,504 INFO L168 Benchmark]: TraceAbstraction took 20165.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 110.6 MB). Free memory was 1.4 GB in the beginning and 986.4 MB in the end (delta: 457.0 MB). Peak memory consumption was 567.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:29,509 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.02 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.84 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 504.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20165.33 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 110.6 MB). Free memory was 1.4 GB in the beginning and 986.4 MB in the end (delta: 457.0 MB). Peak memory consumption was 567.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= product_end0 (+ product_begin0 1)))) (and (and .cse0 (exists ((v_product_begin1_17 Int)) (and (<= (* 2 product_end0) (+ product_begin0 v_product_begin1_17 1)) (<= v_product_begin1_17 (+ product_begin0 1))))) (not (and .cse0 (<= (* 2 product_end0) (+ (* 2 product_begin0) 2)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= product_end0 (+ product_begin0 1)))) (and (and .cse0 (exists ((v_product_begin1_17 Int)) (and (<= (* 2 product_end0) (+ product_begin0 v_product_begin1_17 1)) (<= v_product_begin1_17 (+ product_begin0 1))))) (not (and .cse0 (<= (* 2 product_end0) (+ (* 2 product_begin0) 2)))))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-29-522.csv Received shutdown request...