java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:34:23,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:23,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:23,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:23,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:23,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:23,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:23,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:23,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:23,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:23,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:23,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:23,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:23,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:23,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:23,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:23,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:23,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:23,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:23,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:23,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:23,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:23,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:23,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:23,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:23,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:23,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:23,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:23,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:23,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:23,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:23,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:23,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:23,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:23,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:23,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:23,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:34:23,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:23,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:23,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:23,382 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:23,383 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:23,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:23,383 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:23,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:23,384 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:23,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:23,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:23,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:23,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:23,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:23,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:23,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:23,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:23,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:23,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:23,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:23,386 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:23,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:23,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:23,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:23,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:23,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:23,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:23,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:23,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:23,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:23,388 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:23,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:23,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:23,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:23,481 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:23,481 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:23,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-09-30 20:34:23,483 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-09-30 20:34:23,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:23,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:23,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:23,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:23,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:23,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,590 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:23,590 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:23,590 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:23,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:23,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:23,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:23,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:23,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... [2018-09-30 20:34:23,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:23,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:23,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:23,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:23,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:23,686 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:24,161 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:24,162 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:24 BoogieIcfgContainer [2018-09-30 20:34:24,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:24,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:24,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:24,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:24,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:23" (1/2) ... [2018-09-30 20:34:24,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcefc96 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:24, skipping insertion in model container [2018-09-30 20:34:24,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:24" (2/2) ... [2018-09-30 20:34:24,170 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-09-30 20:34:24,182 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:24,190 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 20:34:24,234 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:24,235 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:24,235 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:24,235 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:24,235 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:24,235 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:24,235 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:24,235 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:24,236 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 20:34:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:24,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:24,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:24,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:24,265 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-09-30 20:34:24,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:24,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:24,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:24,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:24,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:24,487 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-09-30 20:34:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:26,183 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-09-30 20:34:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:26,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:26,201 INFO L225 Difference]: With dead ends: 49 [2018-09-30 20:34:26,201 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 20:34:26,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 20:34:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-09-30 20:34:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:34:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-09-30 20:34:26,247 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-09-30 20:34:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:26,247 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-09-30 20:34:26,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-09-30 20:34:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:26,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:26,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:26,250 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:26,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-09-30 20:34:26,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:26,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:26,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:26,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:26,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:26,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:26,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:26,316 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-09-30 20:34:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:27,133 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-09-30 20:34:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:27,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:27,138 INFO L225 Difference]: With dead ends: 57 [2018-09-30 20:34:27,138 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 20:34:27,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 20:34:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-09-30 20:34:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 20:34:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-09-30 20:34:27,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-09-30 20:34:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:27,150 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-09-30 20:34:27,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-09-30 20:34:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:27,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:27,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:27,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:27,152 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-09-30 20:34:27,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:27,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:27,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:27,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:27,350 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:27,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:27,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:27,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:27,354 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-09-30 20:34:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:29,091 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-09-30 20:34:29,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:34:29,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-30 20:34:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:29,097 INFO L225 Difference]: With dead ends: 84 [2018-09-30 20:34:29,097 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 20:34:29,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 20:34:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-09-30 20:34:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 20:34:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-09-30 20:34:29,118 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-09-30 20:34:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:29,119 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-09-30 20:34:29,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-09-30 20:34:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:34:29,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:29,121 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-30 20:34:29,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:29,123 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-09-30 20:34:29,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:29,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:29,247 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:29,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:29,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:29,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:29,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-09-30 20:34:29,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:29,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:29,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:29,363 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-09-30 20:34:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:31,390 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-09-30 20:34:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:34:31,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-09-30 20:34:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:31,393 INFO L225 Difference]: With dead ends: 142 [2018-09-30 20:34:31,393 INFO L226 Difference]: Without dead ends: 108 [2018-09-30 20:34:31,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:34:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-30 20:34:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-09-30 20:34:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:34:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-09-30 20:34:31,417 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-09-30 20:34:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:31,417 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-09-30 20:34:31,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-09-30 20:34:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:31,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:31,419 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:31,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:31,419 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-09-30 20:34:31,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:31,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:31,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:31,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:31,641 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:31,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-09-30 20:34:31,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:34:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:34:31,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:31,643 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-09-30 20:34:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:34,937 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-09-30 20:34:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:34:34,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-09-30 20:34:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:34,939 INFO L225 Difference]: With dead ends: 148 [2018-09-30 20:34:34,940 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 20:34:34,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:34:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 20:34:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-09-30 20:34:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-30 20:34:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-09-30 20:34:34,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-09-30 20:34:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:34,956 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-09-30 20:34:34,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:34:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-09-30 20:34:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:34,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:34,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:34,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:34,958 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-09-30 20:34:34,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:34,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:34,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:35,085 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:35,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:35,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:34:35,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:35,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:35,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:35,202 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-09-30 20:34:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:37,710 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-09-30 20:34:37,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:34:37,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:34:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:37,713 INFO L225 Difference]: With dead ends: 124 [2018-09-30 20:34:37,713 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 20:34:37,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:34:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 20:34:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-09-30 20:34:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 20:34:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-09-30 20:34:37,735 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-09-30 20:34:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:37,736 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-09-30 20:34:37,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:37,736 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-09-30 20:34:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:37,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:37,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:37,738 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:37,738 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-09-30 20:34:37,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:37,868 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:37,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:37,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:37,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:37,869 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-09-30 20:34:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:39,193 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-09-30 20:34:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:34:39,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 20:34:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:39,198 INFO L225 Difference]: With dead ends: 132 [2018-09-30 20:34:39,198 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 20:34:39,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 20:34:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-09-30 20:34:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:34:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-09-30 20:34:39,231 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-09-30 20:34:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:39,231 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-09-30 20:34:39,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-09-30 20:34:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:39,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:39,233 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:39,233 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:39,233 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-09-30 20:34:39,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:39,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:39,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:39,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:39,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:39,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:39,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:39,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:40,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:40,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:34:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:40,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:40,123 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-09-30 20:34:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:43,295 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-09-30 20:34:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:34:43,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:34:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:43,297 INFO L225 Difference]: With dead ends: 162 [2018-09-30 20:34:43,297 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 20:34:43,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:34:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 20:34:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-09-30 20:34:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 20:34:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-09-30 20:34:43,321 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-09-30 20:34:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:43,321 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-09-30 20:34:43,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-09-30 20:34:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:43,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:43,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:43,323 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:43,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-09-30 20:34:43,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:43,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:43,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:43,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:43,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:43,692 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:43,692 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:43,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:43,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:43,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:43,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-30 20:34:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:43,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:43,875 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-09-30 20:34:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:47,649 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-09-30 20:34:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:34:47,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-30 20:34:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:47,651 INFO L225 Difference]: With dead ends: 223 [2018-09-30 20:34:47,651 INFO L226 Difference]: Without dead ends: 221 [2018-09-30 20:34:47,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:34:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-30 20:34:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-09-30 20:34:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 20:34:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-09-30 20:34:47,677 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-09-30 20:34:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:47,677 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-09-30 20:34:47,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-09-30 20:34:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:47,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:47,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:47,679 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:47,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-09-30 20:34:47,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:47,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:47,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:47,782 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:47,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:47,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:47,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:47,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:47,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:34:47,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:47,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:47,906 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-09-30 20:34:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:50,256 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-09-30 20:34:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:34:50,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:34:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:50,258 INFO L225 Difference]: With dead ends: 222 [2018-09-30 20:34:50,258 INFO L226 Difference]: Without dead ends: 221 [2018-09-30 20:34:50,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-30 20:34:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-09-30 20:34:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 20:34:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-09-30 20:34:50,282 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-09-30 20:34:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:50,282 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-09-30 20:34:50,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-09-30 20:34:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:50,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:50,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:50,284 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:50,284 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-09-30 20:34:50,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:50,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:50,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:50,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:50,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:50,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:50,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:50,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:50,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:50,359 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-09-30 20:34:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:51,396 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-09-30 20:34:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:34:51,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 20:34:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:51,399 INFO L225 Difference]: With dead ends: 203 [2018-09-30 20:34:51,399 INFO L226 Difference]: Without dead ends: 201 [2018-09-30 20:34:51,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-30 20:34:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-09-30 20:34:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-30 20:34:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-09-30 20:34:51,427 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-09-30 20:34:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:51,427 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-09-30 20:34:51,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-09-30 20:34:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:51,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:51,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:51,428 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:51,429 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-09-30 20:34:51,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:51,556 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:51,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:51,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:51,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:51,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:34:51,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:51,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:51,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:51,674 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-09-30 20:34:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:53,967 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-09-30 20:34:53,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:34:53,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:34:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:53,969 INFO L225 Difference]: With dead ends: 241 [2018-09-30 20:34:53,970 INFO L226 Difference]: Without dead ends: 240 [2018-09-30 20:34:53,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-30 20:34:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-09-30 20:34:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:34:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-09-30 20:34:53,999 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-09-30 20:34:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:53,999 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-09-30 20:34:53,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-09-30 20:34:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:54,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:54,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:54,000 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:54,000 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-09-30 20:34:54,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:54,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:54,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:54,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:54,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:34:54,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:54,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:54,096 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-09-30 20:34:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:55,129 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-09-30 20:34:55,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:34:55,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 20:34:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:55,131 INFO L225 Difference]: With dead ends: 220 [2018-09-30 20:34:55,131 INFO L226 Difference]: Without dead ends: 218 [2018-09-30 20:34:55,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-30 20:34:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-09-30 20:34:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-30 20:34:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-09-30 20:34:55,156 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-09-30 20:34:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:55,156 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-09-30 20:34:55,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-09-30 20:34:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:55,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:55,157 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:55,157 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:55,157 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-09-30 20:34:55,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:55,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:55,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:55,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:55,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:55,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:55,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:55,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:55,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:55,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-09-30 20:34:55,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:55,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:55,365 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-09-30 20:34:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:59,242 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-09-30 20:34:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:34:59,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-09-30 20:34:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:59,245 INFO L225 Difference]: With dead ends: 320 [2018-09-30 20:34:59,245 INFO L226 Difference]: Without dead ends: 318 [2018-09-30 20:34:59,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:34:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-30 20:34:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-09-30 20:34:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-30 20:34:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-09-30 20:34:59,289 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-09-30 20:34:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-09-30 20:34:59,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-09-30 20:34:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:59,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:59,291 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:59,291 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:59,291 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-09-30 20:34:59,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:59,379 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:59,380 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:59,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:59,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:59,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:34:59,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:59,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:59,531 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-09-30 20:35:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:01,058 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-09-30 20:35:01,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:35:01,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:35:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:01,060 INFO L225 Difference]: With dead ends: 304 [2018-09-30 20:35:01,060 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 20:35:01,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 20:35:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-09-30 20:35:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-30 20:35:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-09-30 20:35:01,103 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-09-30 20:35:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:01,104 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-09-30 20:35:01,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-09-30 20:35:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:35:01,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:01,104 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:01,105 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:01,105 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-09-30 20:35:01,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:01,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:01,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:01,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:01,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:01,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:01,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:35:01,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:01,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:01,301 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-09-30 20:35:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:03,241 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-09-30 20:35:03,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:35:03,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-09-30 20:35:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:03,243 INFO L225 Difference]: With dead ends: 281 [2018-09-30 20:35:03,243 INFO L226 Difference]: Without dead ends: 280 [2018-09-30 20:35:03,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-30 20:35:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-09-30 20:35:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-30 20:35:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-09-30 20:35:03,288 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-09-30 20:35:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:03,289 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-09-30 20:35:03,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-09-30 20:35:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:35:03,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:03,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:03,290 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:03,290 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-09-30 20:35:03,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:03,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:03,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:03,700 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:03,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:03,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:03,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:03,702 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-09-30 20:35:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:04,731 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-09-30 20:35:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:35:04,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-30 20:35:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:04,734 INFO L225 Difference]: With dead ends: 286 [2018-09-30 20:35:04,734 INFO L226 Difference]: Without dead ends: 284 [2018-09-30 20:35:04,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-30 20:35:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-09-30 20:35:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-30 20:35:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-09-30 20:35:04,786 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-09-30 20:35:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:04,787 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-09-30 20:35:04,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-09-30 20:35:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:04,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:04,788 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:04,788 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:04,788 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-09-30 20:35:04,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:05,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:05,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:05,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:05,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:06,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:06,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 20:35:06,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:35:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:35:06,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:06,034 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-09-30 20:35:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:10,401 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-09-30 20:35:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:35:10,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-30 20:35:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:10,404 INFO L225 Difference]: With dead ends: 515 [2018-09-30 20:35:10,405 INFO L226 Difference]: Without dead ends: 513 [2018-09-30 20:35:10,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-09-30 20:35:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-30 20:35:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-09-30 20:35:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-09-30 20:35:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-09-30 20:35:10,465 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-09-30 20:35:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:10,466 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-09-30 20:35:10,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:35:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-09-30 20:35:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:10,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:10,467 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:10,467 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:10,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-09-30 20:35:10,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:10,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:10,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:10,917 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:10,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:10,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:11,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:11,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 20:35:11,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:35:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:35:11,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:11,060 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-09-30 20:35:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:14,945 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-09-30 20:35:14,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:35:14,945 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-09-30 20:35:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:14,948 INFO L225 Difference]: With dead ends: 631 [2018-09-30 20:35:14,948 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 20:35:14,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:35:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 20:35:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-09-30 20:35:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 20:35:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-09-30 20:35:15,042 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-09-30 20:35:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:15,042 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-09-30 20:35:15,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:35:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-09-30 20:35:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:15,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:15,044 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:15,044 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:15,044 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-09-30 20:35:15,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:15,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:15,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:15,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:15,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:15,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:15,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 20:35:15,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:15,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:15,304 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-09-30 20:35:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:20,351 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-09-30 20:35:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:35:20,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:20,355 INFO L225 Difference]: With dead ends: 1330 [2018-09-30 20:35:20,356 INFO L226 Difference]: Without dead ends: 929 [2018-09-30 20:35:20,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:35:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-09-30 20:35:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-09-30 20:35:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-09-30 20:35:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-09-30 20:35:20,494 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-09-30 20:35:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:20,494 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-09-30 20:35:20,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-09-30 20:35:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:20,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:20,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:20,496 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:20,496 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-09-30 20:35:20,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:20,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:20,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:20,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:21,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:21,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-30 20:35:21,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:21,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:21,015 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-09-30 20:35:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:24,992 INFO L93 Difference]: Finished difference Result 1552 states and 2594 transitions. [2018-09-30 20:35:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:35:24,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:24,996 INFO L225 Difference]: With dead ends: 1552 [2018-09-30 20:35:24,996 INFO L226 Difference]: Without dead ends: 859 [2018-09-30 20:35:24,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:35:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-09-30 20:35:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 697. [2018-09-30 20:35:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-09-30 20:35:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1175 transitions. [2018-09-30 20:35:25,154 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1175 transitions. Word has length 13 [2018-09-30 20:35:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:25,154 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1175 transitions. [2018-09-30 20:35:25,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1175 transitions. [2018-09-30 20:35:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:25,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:25,155 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:25,156 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:25,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-09-30 20:35:25,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:25,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:25,220 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:25,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:25,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:25,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:25,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 20:35:25,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:25,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:25,387 INFO L87 Difference]: Start difference. First operand 697 states and 1175 transitions. Second operand 13 states. [2018-09-30 20:35:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:27,986 INFO L93 Difference]: Finished difference Result 1535 states and 2564 transitions. [2018-09-30 20:35:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:35:27,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-30 20:35:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:27,991 INFO L225 Difference]: With dead ends: 1535 [2018-09-30 20:35:27,991 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 20:35:27,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:35:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 20:35:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 765. [2018-09-30 20:35:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-09-30 20:35:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1284 transitions. [2018-09-30 20:35:28,209 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1284 transitions. Word has length 13 [2018-09-30 20:35:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:28,209 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1284 transitions. [2018-09-30 20:35:28,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1284 transitions. [2018-09-30 20:35:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:28,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:28,210 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:28,211 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:28,211 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-09-30 20:35:28,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:28,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:28,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:28,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 20:35:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:28,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:28,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:28,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 20:35:28,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:35:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:35:28,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:28,839 INFO L87 Difference]: Start difference. First operand 765 states and 1284 transitions. Second operand 10 states. [2018-09-30 20:35:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:30,608 INFO L93 Difference]: Finished difference Result 873 states and 1444 transitions. [2018-09-30 20:35:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:35:30,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 20:35:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:30,611 INFO L225 Difference]: With dead ends: 873 [2018-09-30 20:35:30,612 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 20:35:30,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:35:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 20:35:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 756. [2018-09-30 20:35:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-09-30 20:35:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1266 transitions. [2018-09-30 20:35:30,767 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1266 transitions. Word has length 13 [2018-09-30 20:35:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:30,768 INFO L480 AbstractCegarLoop]: Abstraction has 756 states and 1266 transitions. [2018-09-30 20:35:30,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:35:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1266 transitions. [2018-09-30 20:35:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:30,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:30,769 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:30,769 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:30,769 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-09-30 20:35:30,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:30,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:30,862 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:30,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:30,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:30,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:31,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:31,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 20:35:31,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:31,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:31,183 INFO L87 Difference]: Start difference. First operand 756 states and 1266 transitions. Second operand 14 states. [2018-09-30 20:35:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:36,269 INFO L93 Difference]: Finished difference Result 1931 states and 3204 transitions. [2018-09-30 20:35:36,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:35:36,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:36,274 INFO L225 Difference]: With dead ends: 1931 [2018-09-30 20:35:36,274 INFO L226 Difference]: Without dead ends: 1176 [2018-09-30 20:35:36,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:35:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-09-30 20:35:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 835. [2018-09-30 20:35:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-09-30 20:35:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1399 transitions. [2018-09-30 20:35:36,435 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1399 transitions. Word has length 13 [2018-09-30 20:35:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:36,435 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1399 transitions. [2018-09-30 20:35:36,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1399 transitions. [2018-09-30 20:35:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:36,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:36,436 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:36,436 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:36,436 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-09-30 20:35:36,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:36,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:36,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:36,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:36,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:36,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:36,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:36,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 20:35:36,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:35:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:35:36,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:36,646 INFO L87 Difference]: Start difference. First operand 835 states and 1399 transitions. Second operand 10 states. [2018-09-30 20:35:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:38,819 INFO L93 Difference]: Finished difference Result 974 states and 1611 transitions. [2018-09-30 20:35:38,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:35:38,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 20:35:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:38,823 INFO L225 Difference]: With dead ends: 974 [2018-09-30 20:35:38,823 INFO L226 Difference]: Without dead ends: 972 [2018-09-30 20:35:38,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-09-30 20:35:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 833. [2018-09-30 20:35:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-09-30 20:35:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1397 transitions. [2018-09-30 20:35:38,998 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1397 transitions. Word has length 13 [2018-09-30 20:35:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:38,998 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1397 transitions. [2018-09-30 20:35:38,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:35:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1397 transitions. [2018-09-30 20:35:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:38,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:38,999 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:38,999 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:38,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-09-30 20:35:38,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:39,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:39,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 20:35:39,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:39,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:39,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:39,285 INFO L87 Difference]: Start difference. First operand 833 states and 1397 transitions. Second operand 14 states. [2018-09-30 20:35:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:43,981 INFO L93 Difference]: Finished difference Result 2001 states and 3315 transitions. [2018-09-30 20:35:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:35:43,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:43,986 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 20:35:43,986 INFO L226 Difference]: Without dead ends: 1165 [2018-09-30 20:35:43,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:35:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-09-30 20:35:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 970. [2018-09-30 20:35:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-30 20:35:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1613 transitions. [2018-09-30 20:35:44,273 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1613 transitions. Word has length 13 [2018-09-30 20:35:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:44,273 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1613 transitions. [2018-09-30 20:35:44,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1613 transitions. [2018-09-30 20:35:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:44,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:44,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:44,275 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:44,275 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:44,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-09-30 20:35:44,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:44,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:44,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:44,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:45,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:46,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:46,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-09-30 20:35:46,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:46,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:46,022 INFO L87 Difference]: Start difference. First operand 970 states and 1613 transitions. Second operand 14 states. [2018-09-30 20:35:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:49,117 INFO L93 Difference]: Finished difference Result 2094 states and 3453 transitions. [2018-09-30 20:35:49,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:35:49,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:49,121 INFO L225 Difference]: With dead ends: 2094 [2018-09-30 20:35:49,121 INFO L226 Difference]: Without dead ends: 1121 [2018-09-30 20:35:49,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-09-30 20:35:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-09-30 20:35:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 950. [2018-09-30 20:35:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-09-30 20:35:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1579 transitions. [2018-09-30 20:35:49,316 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1579 transitions. Word has length 13 [2018-09-30 20:35:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:49,316 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1579 transitions. [2018-09-30 20:35:49,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1579 transitions. [2018-09-30 20:35:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:49,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:49,317 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:49,317 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:49,318 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-09-30 20:35:49,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:49,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:49,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:49,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:49,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:49,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:50,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:50,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 20:35:50,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:50,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:50,162 INFO L87 Difference]: Start difference. First operand 950 states and 1579 transitions. Second operand 13 states. [2018-09-30 20:35:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:52,927 INFO L93 Difference]: Finished difference Result 1334 states and 2168 transitions. [2018-09-30 20:35:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:35:52,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-30 20:35:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:52,930 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 20:35:52,931 INFO L226 Difference]: Without dead ends: 1076 [2018-09-30 20:35:52,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:35:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-09-30 20:35:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 975. [2018-09-30 20:35:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-09-30 20:35:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1619 transitions. [2018-09-30 20:35:53,108 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1619 transitions. Word has length 13 [2018-09-30 20:35:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:53,108 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 1619 transitions. [2018-09-30 20:35:53,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1619 transitions. [2018-09-30 20:35:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:53,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:53,109 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:53,109 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:53,110 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-09-30 20:35:53,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:53,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:53,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:53,229 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:53,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:53,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:53,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:53,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:53,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-09-30 20:35:53,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:53,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:53,352 INFO L87 Difference]: Start difference. First operand 975 states and 1619 transitions. Second operand 14 states. [2018-09-30 20:35:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:58,448 INFO L93 Difference]: Finished difference Result 2736 states and 4494 transitions. [2018-09-30 20:35:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:35:58,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 20:35:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:58,454 INFO L225 Difference]: With dead ends: 2736 [2018-09-30 20:35:58,455 INFO L226 Difference]: Without dead ends: 1758 [2018-09-30 20:35:58,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:35:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2018-09-30 20:35:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1307. [2018-09-30 20:35:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2018-09-30 20:35:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2157 transitions. [2018-09-30 20:35:58,730 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2157 transitions. Word has length 13 [2018-09-30 20:35:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:58,731 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 2157 transitions. [2018-09-30 20:35:58,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2157 transitions. [2018-09-30 20:35:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:35:58,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:58,732 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:58,732 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:58,732 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-09-30 20:35:58,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:58,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:58,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:59,091 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:59,091 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:59,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:59,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:59,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:59,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-09-30 20:35:59,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:35:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:35:59,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:59,272 INFO L87 Difference]: Start difference. First operand 1307 states and 2157 transitions. Second operand 18 states. [2018-09-30 20:36:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:04,741 INFO L93 Difference]: Finished difference Result 2855 states and 4676 transitions. [2018-09-30 20:36:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:36:04,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2018-09-30 20:36:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:04,746 INFO L225 Difference]: With dead ends: 2855 [2018-09-30 20:36:04,746 INFO L226 Difference]: Without dead ends: 1547 [2018-09-30 20:36:04,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-09-30 20:36:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2018-09-30 20:36:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1230. [2018-09-30 20:36:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-09-30 20:36:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2012 transitions. [2018-09-30 20:36:05,020 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2012 transitions. Word has length 15 [2018-09-30 20:36:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:05,021 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 2012 transitions. [2018-09-30 20:36:05,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:36:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2012 transitions. [2018-09-30 20:36:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:05,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:05,022 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:05,022 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:05,022 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-09-30 20:36:05,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:05,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:05,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:05,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:05,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:05,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:05,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:05,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-09-30 20:36:05,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:36:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:36:05,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:05,306 INFO L87 Difference]: Start difference. First operand 1230 states and 2012 transitions. Second operand 17 states. [2018-09-30 20:36:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:09,171 INFO L93 Difference]: Finished difference Result 1401 states and 2269 transitions. [2018-09-30 20:36:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:36:09,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 20:36:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:09,176 INFO L225 Difference]: With dead ends: 1401 [2018-09-30 20:36:09,176 INFO L226 Difference]: Without dead ends: 1399 [2018-09-30 20:36:09,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:36:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-09-30 20:36:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1212. [2018-09-30 20:36:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-09-30 20:36:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1981 transitions. [2018-09-30 20:36:09,444 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1981 transitions. Word has length 15 [2018-09-30 20:36:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:09,444 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1981 transitions. [2018-09-30 20:36:09,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:36:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1981 transitions. [2018-09-30 20:36:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:09,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:09,445 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:09,446 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:09,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 1 times [2018-09-30 20:36:09,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:09,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:09,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:09,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:09,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:09,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:09,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 20:36:09,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:36:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:36:09,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:09,755 INFO L87 Difference]: Start difference. First operand 1212 states and 1981 transitions. Second operand 17 states. [2018-09-30 20:36:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:15,183 INFO L93 Difference]: Finished difference Result 2660 states and 4318 transitions. [2018-09-30 20:36:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:36:15,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 20:36:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:15,188 INFO L225 Difference]: With dead ends: 2660 [2018-09-30 20:36:15,188 INFO L226 Difference]: Without dead ends: 1447 [2018-09-30 20:36:15,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:36:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-09-30 20:36:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1135. [2018-09-30 20:36:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2018-09-30 20:36:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1836 transitions. [2018-09-30 20:36:15,466 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1836 transitions. Word has length 15 [2018-09-30 20:36:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:15,466 INFO L480 AbstractCegarLoop]: Abstraction has 1135 states and 1836 transitions. [2018-09-30 20:36:15,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:36:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1836 transitions. [2018-09-30 20:36:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:15,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:15,467 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:15,467 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:15,468 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-09-30 20:36:15,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:15,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:15,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:15,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:15,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:15,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:15,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:15,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-09-30 20:36:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:36:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:36:15,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:15,794 INFO L87 Difference]: Start difference. First operand 1135 states and 1836 transitions. Second operand 16 states. [2018-09-30 20:36:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:17,134 INFO L93 Difference]: Finished difference Result 1213 states and 1948 transitions. [2018-09-30 20:36:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:36:17,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 20:36:17,134 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2018-09-30 20:36:17,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 20:36:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:17,135 FATAL L834 BasicCegarLoop]: -- [2018-09-30 20:36:17,135 FATAL L835 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2018-09-30 20:36:17,135 FATAL L836 BasicCegarLoop]: word: [2018-09-30 20:36:17,135 FATAL L838 BasicCegarLoop]: havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1; [2018-09-30 20:36:17,138 FATAL L838 BasicCegarLoop]: begin1 := next;next := next + workload;end1 := next; [2018-09-30 20:36:17,138 FATAL L838 BasicCegarLoop]: assume begin1 < end1; [2018-09-30 20:36:17,138 FATAL L838 BasicCegarLoop]: begin0 := next;next := next + workload;end0 := next; [2018-09-30 20:36:17,138 FATAL L838 BasicCegarLoop]: assume begin0 < end0; [2018-09-30 20:36:17,138 FATAL L838 BasicCegarLoop]: working0 := begin0; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: assume working0 != working1;begin0 := begin0 + 1; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: assume !(begin0 < end0); [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: begin0 := next;next := next + workload;end0 := next; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: assume begin0 < end0; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: working1 := begin1; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: assume working0 != working1;begin1 := begin1 + 1; [2018-09-30 20:36:17,139 FATAL L838 BasicCegarLoop]: assume !(begin1 < end1); [2018-09-30 20:36:17,140 FATAL L838 BasicCegarLoop]: working0 := begin0; [2018-09-30 20:36:17,140 FATAL L838 BasicCegarLoop]: assume !(working0 != working1); [2018-09-30 20:36:17,140 FATAL L840 BasicCegarLoop]: original automaton: [2018-09-30 20:36:17,140 FATAL L841 BasicCegarLoop]: FiniteAutomaton nwa = ( alphabet = {"havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "begin0 := next;next := next + workload;end0 := next;" "assume begin1 < end1;" "assume begin0 < end0;" "assume !(begin1 < end1);" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "begin0 := next;next := next + workload;end0 := next;" "assume begin0 < end0;" "assume !(begin0 < end0);" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" }, states = {"61632#(<= (+ product_working1 2) product_working0)" "61636#(< 0 product_workload)" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "61622#true" "61623#false" "61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))" "61625#(= product_end1 product_next)" "61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61629#(<= (+ product_begin1 2) product_next)" "61630#(<= (+ product_begin1 2) product_begin0)" "61631#(<= (+ product_working1 2) product_begin0)" }, initialStates = {"61622#true" }, finalStates = {"61623#false" }, transitions = { ("61632#(<= (+ product_working1 2) product_working0)" "assume !(working0 != working1);" "61623#false") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "working1 := begin1;" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))" "assume begin0 < end0;" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "begin0 := next;next := next + workload;end0 := next;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin1 < end1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "assume working0 != working1;begin1 := begin1 + 1;" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "working0 := begin0;" "61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))") ("61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))" "assume !(begin1 < end1);" "61676#(exists ((product_workload Int)) (and (<= (+ product_working1 (* 2 product_workload)) product_begin0) (< 0 product_workload)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "begin0 := next;next := next + workload;end0 := next;" "61668#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_begin0)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "working0 := begin0;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume begin0 < end0;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume working0 != working1;begin0 := begin0 + 1;" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))" "assume !(begin0 < end0);" "61648#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next)))") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61636#(< 0 product_workload)") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61622#true") ("61622#true" "begin1 := next;next := next + workload;end1 := next;" "61625#(= product_end1 product_next)") ("61688#(exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ product_working1 (* 2 product_workload)) product_working0)))" "assume !(working0 != working1);" "61623#false") ("61625#(= product_end1 product_next)" "assume begin1 < end1;" "61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61626#(and (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61627#(and (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume begin0 < end0;" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working0 := begin0;" "61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61628#(and (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin0 := begin0 + 1;" "61629#(<= (+ product_begin1 2) product_next)") ("61629#(<= (+ product_begin1 2) product_next)" "begin0 := next;next := next + workload;end0 := next;" "61630#(<= (+ product_begin1 2) product_begin0)") ("61629#(<= (+ product_begin1 2) product_next)" "assume !(begin0 < end0);" "61629#(<= (+ product_begin1 2) product_next)") ("61630#(<= (+ product_begin1 2) product_begin0)" "working1 := begin1;" "61631#(<= (+ product_working1 2) product_begin0)") ("61630#(<= (+ product_begin1 2) product_begin0)" "assume begin0 < end0;" "61630#(<= (+ product_begin1 2) product_begin0)") ("61631#(<= (+ product_working1 2) product_begin0)" "assume working0 != working1;begin1 := begin1 + 1;" "61631#(<= (+ product_working1 2) product_begin0)") ("61631#(<= (+ product_working1 2) product_begin0)" "working0 := begin0;" "61632#(<= (+ product_working1 2) product_working0)") ("61631#(<= (+ product_working1 2) product_begin0)" "assume !(begin1 < end1);" "61631#(<= (+ product_working1 2) product_begin0)") } ); [2018-09-30 20:36:17,144 FATAL L842 BasicCegarLoop]: enhanced automaton: [2018-09-30 20:36:17,145 FATAL L843 BasicCegarLoop]: FiniteAutomaton nwa = ( alphabet = {"havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "begin0 := next;next := next + workload;end0 := next;" "assume begin1 < end1;" "assume begin0 < end0;" "assume !(begin1 < end1);" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" "begin1 := next;next := next + workload;end1 := next;" "assume begin1 < end1;" "assume !(begin1 < end1);" "begin0 := next;next := next + workload;end0 := next;" "assume begin0 < end0;" "assume !(begin0 < end0);" "working1 := begin1;" "assume !(working0 != working1);" "assume working0 != working1;begin1 := begin1 + 1;" "assume begin1 < end1;" "assume !(begin1 < end1);" "working0 := begin0;" "assume !(working0 != working1);" "assume working0 != working1;begin0 := begin0 + 1;" "assume begin0 < end0;" "assume !(begin0 < end0);" }, states = {"61713#(and (< 0 product_workload) (= product_end1 product_next))" "61636#(< 0 product_workload)" "61622#true" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" }, initialStates = {"61622#true" }, finalStates = {}, transitions = { ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin1 < end1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin1 < end1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "working0 := begin0;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(working0 != working1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin1 < end1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume working0 != working1;begin0 := begin0 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin1 < end1);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume begin0 < end0;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "assume !(begin0 < end0);" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61713#(and (< 0 product_workload) (= product_end1 product_next))" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "working1 := begin1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin1 < end1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin1 < end1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "working0 := begin0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin0 := begin0 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin0 < end0);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "begin1 := next;next := next + workload;end1 := next;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61636#(< 0 product_workload)" "begin0 := next;next := next + workload;end0 := next;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "working1 := begin1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin1 < end1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin1 < end1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "working0 := begin0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(working0 != working1);" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume working0 != working1;begin0 := begin0 + 1;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume begin0 < end0;" "61636#(< 0 product_workload)") ("61636#(< 0 product_workload)" "assume !(begin0 < end0);" "61636#(< 0 product_workload)") ("61622#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "61636#(< 0 product_workload)") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working1 := begin1;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume !(working0 != working1);" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "working0 := begin0;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume begin0 < end0;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume !(working0 != working1);" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))" "assume working0 != working1;begin0 := begin0 + 1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "begin0 := next;next := next + workload;end0 := next;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin0 < end0;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin1 := begin1 + 1;" "61636#(< 0 product_workload)") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "working0 := begin0;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume working0 != working1;begin0 := begin0 + 1;" "61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume begin0 < end0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))" "assume !(begin0 < end0);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working0 := begin0;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin0 := begin0 + 1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin0 < end0;" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(begin0 < end0);" "61724#(and (< 0 product_workload) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin1 < end1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "begin0 := next;next := next + workload;end0 := next;" "61704#(and (< 0 product_workload) (<= (+ product_end0 product_begin1 1) (+ product_end1 product_next)) (<= (+ product_workload product_begin1) product_next) (<= (+ product_begin0 product_begin1 2) (+ product_end1 product_next)) (= product_end1 product_begin0))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working1 := begin1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin1 < end1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin1 := begin1 + 1;" "61713#(and (< 0 product_workload) (= product_end1 product_next))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "working0 := begin0;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(working0 != working1);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume working0 != working1;begin0 := begin0 + 1;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume begin0 < end0;" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))" "assume !(begin0 < end0);" "61695#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (= product_end1 product_next) (<= (+ product_begin1 1) product_end1))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "working1 := begin1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "working0 := begin0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume !(working0 != working1);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume working0 != working1;begin0 := begin0 + 1;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume begin0 < end0;" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") ("61791#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next) (exists ((product_workload Int)) (and (< 0 product_workload) (<= (+ (* 2 product_workload) product_begin1) product_next))))" "assume !(begin0 < end0);" "61640#(and (< 0 product_workload) (<= (+ product_workload product_begin1) product_next))") } ); [2018-09-30 20:36:17,150 FATAL L844 BasicCegarLoop]: -- [2018-09-30 20:36:17,151 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:719) 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:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) 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-09-30 20:36:17,155 INFO L168 Benchmark]: Toolchain (without parser) took 113606.27 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 144.4 MB). Peak memory consumption was 516.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:36:17,157 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:36:17,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:36:17,160 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:36:17,160 INFO L168 Benchmark]: RCFGBuilder took 547.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:36:17,161 INFO L168 Benchmark]: TraceAbstraction took 112990.92 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 123.3 MB). Peak memory consumption was 495.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:36:17,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.56 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 21.01 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 547.70 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 112990.92 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 123.3 MB). Peak memory consumption was 495.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 33 broken: counterexample of length 16 not accepted (original is ok): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:819) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-36-17-177.csv Received shutdown request...