java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:53,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:53,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:53,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:53,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:53,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:53,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:53,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:53,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:53,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:53,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:53,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:53,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:53,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:53,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:53,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:53,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:53,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:53,647 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:53,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:53,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:53,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:53,654 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:53,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:53,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:53,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:53,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:53,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:53,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:53,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:53,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:53,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:53,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:53,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:53,662 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:53,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:53,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:53,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:53,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:53,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:53,682 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:53,682 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:53,683 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:53,683 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:53,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:53,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:53,684 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:53,685 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:53,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:53,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:53,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:53,685 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:53,686 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:53,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:53,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:53,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:53,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:53,687 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:53,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:53,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:53,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:53,687 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:53,688 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:53,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:53,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:53,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:53,758 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:53,759 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:53,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-01 00:24:53,760 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-01 00:24:53,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:53,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:53,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:53,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:53,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:53,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:53,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:53,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:53,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:53,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... [2018-10-01 00:24:53,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:53,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:53,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:53,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:53,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-01 00:24:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-01 00:24:53,983 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-01 00:24:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-01 00:24:53,983 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-01 00:24:53,983 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-01 00:24:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:24:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:24:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-01 00:24:53,984 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-01 00:24:54,768 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:24:54,769 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:54 BoogieIcfgContainer [2018-10-01 00:24:54,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:54,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:54,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:54,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:54,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:53" (1/2) ... [2018-10-01 00:24:54,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7f03e7 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:54, skipping insertion in model container [2018-10-01 00:24:54,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:54" (2/2) ... [2018-10-01 00:24:54,777 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-01 00:24:54,788 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:54,797 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-01 00:24:54,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:54,853 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:54,854 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:54,854 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:54,854 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:54,854 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:54,854 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:54,855 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:54,855 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-01 00:24:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:54,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:54,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:54,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:54,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-01 00:24:54,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:54,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:54,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:54,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:55,211 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:55,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:55,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:55,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:55,229 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-01 00:24:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:57,272 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-01 00:24:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:57,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:57,286 INFO L225 Difference]: With dead ends: 72 [2018-10-01 00:24:57,286 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 00:24:57,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 00:24:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-01 00:24:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-01 00:24:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-01 00:24:57,340 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-01 00:24:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:57,340 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-01 00:24:57,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-01 00:24:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:57,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:57,342 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:57,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:57,343 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-01 00:24:57,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:57,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:57,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:57,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:57,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:57,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:57,491 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-01 00:24:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:58,526 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-01 00:24:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:58,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:58,530 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:24:58,530 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:24:58,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:24:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-01 00:24:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:24:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-01 00:24:58,545 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-01 00:24:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:58,545 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-01 00:24:58,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-01 00:24:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:24:58,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:58,549 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:58,549 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:58,549 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-01 00:24:58,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:58,728 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:58,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:58,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:58,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:58,729 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-01 00:25:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:00,831 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-01 00:25:00,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:25:00,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-01 00:25:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:00,841 INFO L225 Difference]: With dead ends: 122 [2018-10-01 00:25:00,841 INFO L226 Difference]: Without dead ends: 120 [2018-10-01 00:25:00,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-01 00:25:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-01 00:25:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:25:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-01 00:25:00,875 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-01 00:25:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:00,876 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-01 00:25:00,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-01 00:25:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:00,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:00,878 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:00,878 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:00,878 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-01 00:25:00,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:00,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:01,010 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:01,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:01,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:01,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:01,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:01,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-01 00:25:01,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:01,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:01,436 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-01 00:25:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:04,051 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-01 00:25:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:25:04,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-01 00:25:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:04,055 INFO L225 Difference]: With dead ends: 168 [2018-10-01 00:25:04,055 INFO L226 Difference]: Without dead ends: 121 [2018-10-01 00:25:04,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-01 00:25:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-01 00:25:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:25:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-01 00:25:04,080 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-01 00:25:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:04,081 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-01 00:25:04,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-01 00:25:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:25:04,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:04,084 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:04,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:04,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-01 00:25:04,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:04,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:04,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:04,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:04,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:04,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:04,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-01 00:25:04,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:25:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:25:04,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:04,345 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-01 00:25:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:06,175 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-01 00:25:06,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:25:06,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-01 00:25:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:06,177 INFO L225 Difference]: With dead ends: 164 [2018-10-01 00:25:06,178 INFO L226 Difference]: Without dead ends: 162 [2018-10-01 00:25:06,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-01 00:25:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-01 00:25:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:25:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-01 00:25:06,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-01 00:25:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:06,199 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-01 00:25:06,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:25:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-01 00:25:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:25:06,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:06,201 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:06,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:06,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-01 00:25:06,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:06,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:06,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:06,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:06,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:06,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:06,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-01 00:25:06,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:25:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:25:06,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:06,450 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-01 00:25:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:08,641 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-01 00:25:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:25:08,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-01 00:25:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:08,646 INFO L225 Difference]: With dead ends: 181 [2018-10-01 00:25:08,646 INFO L226 Difference]: Without dead ends: 179 [2018-10-01 00:25:08,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-01 00:25:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-01 00:25:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:25:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-01 00:25:08,668 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-01 00:25:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:08,669 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-01 00:25:08,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:25:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-01 00:25:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:08,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:08,671 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:08,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:08,671 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-01 00:25:08,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:08,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:08,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:08,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:08,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:08,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:08,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-01 00:25:08,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:08,972 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:08,972 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-01 00:25:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:10,700 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-01 00:25:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:25:10,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-01 00:25:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:10,701 INFO L225 Difference]: With dead ends: 217 [2018-10-01 00:25:10,701 INFO L226 Difference]: Without dead ends: 133 [2018-10-01 00:25:10,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-01 00:25:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-01 00:25:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-01 00:25:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-01 00:25:10,724 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-01 00:25:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:10,725 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-01 00:25:10,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-01 00:25:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:10,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:10,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:10,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:10,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-01 00:25:10,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:10,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:10,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:10,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:10,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:11,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:11,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-01 00:25:11,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:11,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:11,047 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-01 00:25:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:15,158 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-01 00:25:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:15,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-01 00:25:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:15,163 INFO L225 Difference]: With dead ends: 194 [2018-10-01 00:25:15,163 INFO L226 Difference]: Without dead ends: 192 [2018-10-01 00:25:15,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-01 00:25:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-01 00:25:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:25:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-01 00:25:15,206 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-01 00:25:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:15,207 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-01 00:25:15,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-01 00:25:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:15,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:15,208 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:15,208 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:15,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-01 00:25:15,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:15,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:15,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:15,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:16,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:16,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-01 00:25:16,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:16,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:16,057 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-01 00:25:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:20,147 INFO L93 Difference]: Finished difference Result 242 states and 345 transitions. [2018-10-01 00:25:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:20,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-01 00:25:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:20,154 INFO L225 Difference]: With dead ends: 242 [2018-10-01 00:25:20,154 INFO L226 Difference]: Without dead ends: 241 [2018-10-01 00:25:20,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-01 00:25:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2018-10-01 00:25:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-01 00:25:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2018-10-01 00:25:20,183 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 14 [2018-10-01 00:25:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:20,183 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2018-10-01 00:25:20,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2018-10-01 00:25:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:20,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:20,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:20,185 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:20,185 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-01 00:25:20,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:20,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:20,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:20,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:20,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:20,295 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:20,295 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:20,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:20,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:20,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-01 00:25:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:20,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:20,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:20,549 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand 14 states. [2018-10-01 00:25:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:25,141 INFO L93 Difference]: Finished difference Result 290 states and 410 transitions. [2018-10-01 00:25:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:25:25,145 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-01 00:25:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:25,147 INFO L225 Difference]: With dead ends: 290 [2018-10-01 00:25:25,147 INFO L226 Difference]: Without dead ends: 288 [2018-10-01 00:25:25,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-01 00:25:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 223. [2018-10-01 00:25:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-01 00:25:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2018-10-01 00:25:25,181 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 14 [2018-10-01 00:25:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:25,181 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2018-10-01 00:25:25,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2018-10-01 00:25:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:25,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:25,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:25,183 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:25,183 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-01 00:25:25,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:25,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:25,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:25,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:25,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:25,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:25,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-01 00:25:25,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:25,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:25,435 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand 14 states. [2018-10-01 00:25:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:29,071 INFO L93 Difference]: Finished difference Result 316 states and 447 transitions. [2018-10-01 00:25:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:25:29,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-01 00:25:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:29,076 INFO L225 Difference]: With dead ends: 316 [2018-10-01 00:25:29,076 INFO L226 Difference]: Without dead ends: 314 [2018-10-01 00:25:29,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-01 00:25:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-01 00:25:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-01 00:25:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 353 transitions. [2018-10-01 00:25:29,122 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 353 transitions. Word has length 14 [2018-10-01 00:25:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:29,123 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 353 transitions. [2018-10-01 00:25:29,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 353 transitions. [2018-10-01 00:25:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:29,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:29,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:29,124 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:29,124 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-01 00:25:29,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:29,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:29,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:29,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:29,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:29,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:29,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:29,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-01 00:25:29,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:29,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:29,382 INFO L87 Difference]: Start difference. First operand 245 states and 353 transitions. Second operand 13 states. [2018-10-01 00:25:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:31,955 INFO L93 Difference]: Finished difference Result 323 states and 464 transitions. [2018-10-01 00:25:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:31,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-01 00:25:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:31,963 INFO L225 Difference]: With dead ends: 323 [2018-10-01 00:25:31,963 INFO L226 Difference]: Without dead ends: 321 [2018-10-01 00:25:31,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-01 00:25:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2018-10-01 00:25:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-01 00:25:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2018-10-01 00:25:32,025 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 14 [2018-10-01 00:25:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:32,025 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2018-10-01 00:25:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2018-10-01 00:25:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:32,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:32,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:32,027 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:32,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-01 00:25:32,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,167 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:32,167 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:32,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-01 00:25:32,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:25:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:25:32,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:32,328 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand 14 states. [2018-10-01 00:25:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:36,464 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-10-01 00:25:36,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:25:36,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-01 00:25:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:36,467 INFO L225 Difference]: With dead ends: 379 [2018-10-01 00:25:36,468 INFO L226 Difference]: Without dead ends: 377 [2018-10-01 00:25:36,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-01 00:25:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 302. [2018-10-01 00:25:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-01 00:25:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 445 transitions. [2018-10-01 00:25:36,519 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 445 transitions. Word has length 14 [2018-10-01 00:25:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 445 transitions. [2018-10-01 00:25:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:25:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 445 transitions. [2018-10-01 00:25:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:36,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:36,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:36,521 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:36,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-01 00:25:36,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:36,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:36,610 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:36,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:36,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:36,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-10-01 00:25:37,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:37,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2018-10-01 00:25:37,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:25:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:25:37,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:37,017 INFO L87 Difference]: Start difference. First operand 302 states and 445 transitions. Second operand 16 states. [2018-10-01 00:25:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:40,258 INFO L93 Difference]: Finished difference Result 356 states and 514 transitions. [2018-10-01 00:25:40,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:25:40,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-10-01 00:25:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:40,261 INFO L225 Difference]: With dead ends: 356 [2018-10-01 00:25:40,261 INFO L226 Difference]: Without dead ends: 354 [2018-10-01 00:25:40,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-01 00:25:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 312. [2018-10-01 00:25:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-01 00:25:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 460 transitions. [2018-10-01 00:25:40,312 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 460 transitions. Word has length 14 [2018-10-01 00:25:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:40,312 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 460 transitions. [2018-10-01 00:25:40,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:25:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 460 transitions. [2018-10-01 00:25:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:40,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:40,314 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:40,314 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:40,314 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-01 00:25:40,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:40,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:40,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:40,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:40,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:40,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:40,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:40,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 13 [2018-10-01 00:25:40,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:25:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:25:40,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:40,676 INFO L87 Difference]: Start difference. First operand 312 states and 460 transitions. Second operand 15 states. [2018-10-01 00:25:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:44,538 INFO L93 Difference]: Finished difference Result 365 states and 536 transitions. [2018-10-01 00:25:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:44,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-01 00:25:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:44,541 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:25:44,541 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:25:44,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:25:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2018-10-01 00:25:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-01 00:25:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 483 transitions. [2018-10-01 00:25:44,600 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 483 transitions. Word has length 14 [2018-10-01 00:25:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:44,600 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 483 transitions. [2018-10-01 00:25:44,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:25:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 483 transitions. [2018-10-01 00:25:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:25:44,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:44,602 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:44,602 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:44,602 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-01 00:25:44,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:44,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:44,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:44,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:44,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:45,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:45,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:45,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:45,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:45,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-01 00:25:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:25:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:25:45,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:45,634 INFO L87 Difference]: Start difference. First operand 328 states and 483 transitions. Second operand 16 states. [2018-10-01 00:25:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:49,614 INFO L93 Difference]: Finished difference Result 429 states and 619 transitions. [2018-10-01 00:25:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:25:49,622 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-01 00:25:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:49,625 INFO L225 Difference]: With dead ends: 429 [2018-10-01 00:25:49,625 INFO L226 Difference]: Without dead ends: 427 [2018-10-01 00:25:49,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:25:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-01 00:25:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 241. [2018-10-01 00:25:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-01 00:25:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 350 transitions. [2018-10-01 00:25:49,689 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 350 transitions. Word has length 17 [2018-10-01 00:25:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:49,689 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 350 transitions. [2018-10-01 00:25:49,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:25:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 350 transitions. [2018-10-01 00:25:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:25:49,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:49,690 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:49,691 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:49,691 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-01 00:25:49,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:50,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:50,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:50,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:50,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:50,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:50,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-01 00:25:50,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:25:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:25:50,764 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:50,764 INFO L87 Difference]: Start difference. First operand 241 states and 350 transitions. Second operand 16 states. [2018-10-01 00:25:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:54,382 INFO L93 Difference]: Finished difference Result 329 states and 465 transitions. [2018-10-01 00:25:54,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:25:54,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-01 00:25:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:54,384 INFO L225 Difference]: With dead ends: 329 [2018-10-01 00:25:54,384 INFO L226 Difference]: Without dead ends: 327 [2018-10-01 00:25:54,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:25:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-01 00:25:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 157. [2018-10-01 00:25:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-01 00:25:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2018-10-01 00:25:54,440 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 17 [2018-10-01 00:25:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:54,441 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2018-10-01 00:25:54,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:25:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2018-10-01 00:25:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:25:54,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:54,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:54,442 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:54,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-01 00:25:54,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:54,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:54,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:54,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:54,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:54,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:54,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:54,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:54,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:54,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-01 00:25:54,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:54,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:54,690 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand 13 states. [2018-10-01 00:25:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:56,606 INFO L93 Difference]: Finished difference Result 228 states and 322 transitions. [2018-10-01 00:25:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:25:56,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:25:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:56,608 INFO L225 Difference]: With dead ends: 228 [2018-10-01 00:25:56,608 INFO L226 Difference]: Without dead ends: 226 [2018-10-01 00:25:56,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-01 00:25:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 172. [2018-10-01 00:25:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-01 00:25:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2018-10-01 00:25:56,674 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 18 [2018-10-01 00:25:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:56,674 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2018-10-01 00:25:56,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2018-10-01 00:25:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:25:56,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:56,675 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:56,676 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:56,676 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-01 00:25:56,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:57,203 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:57,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:57,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:57,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:57,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-01 00:25:57,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:57,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:57,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:57,372 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand 13 states. [2018-10-01 00:26:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:04,465 INFO L93 Difference]: Finished difference Result 793 states and 1126 transitions. [2018-10-01 00:26:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:26:04,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:04,468 INFO L225 Difference]: With dead ends: 793 [2018-10-01 00:26:04,469 INFO L226 Difference]: Without dead ends: 624 [2018-10-01 00:26:04,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:26:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-01 00:26:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 327. [2018-10-01 00:26:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-01 00:26:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 469 transitions. [2018-10-01 00:26:04,616 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 469 transitions. Word has length 18 [2018-10-01 00:26:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:04,617 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 469 transitions. [2018-10-01 00:26:04,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 469 transitions. [2018-10-01 00:26:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:04,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:04,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:04,618 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:04,619 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-01 00:26:04,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:04,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:04,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:05,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:05,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:05,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:05,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:05,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:05,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-01 00:26:05,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:05,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:05,231 INFO L87 Difference]: Start difference. First operand 327 states and 469 transitions. Second operand 13 states. [2018-10-01 00:26:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:08,906 INFO L93 Difference]: Finished difference Result 776 states and 1111 transitions. [2018-10-01 00:26:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:26:08,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:08,909 INFO L225 Difference]: With dead ends: 776 [2018-10-01 00:26:08,909 INFO L226 Difference]: Without dead ends: 451 [2018-10-01 00:26:08,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:26:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-01 00:26:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 351. [2018-10-01 00:26:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-01 00:26:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2018-10-01 00:26:09,044 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 18 [2018-10-01 00:26:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:09,045 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2018-10-01 00:26:09,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2018-10-01 00:26:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:09,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:09,046 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:09,047 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:09,047 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-01 00:26:09,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:09,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:09,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:09,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:09,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:09,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:09,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:26:09,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:09,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:09,310 INFO L87 Difference]: Start difference. First operand 351 states and 502 transitions. Second operand 13 states. [2018-10-01 00:26:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:14,626 INFO L93 Difference]: Finished difference Result 1134 states and 1611 transitions. [2018-10-01 00:26:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:26:14,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:14,630 INFO L225 Difference]: With dead ends: 1134 [2018-10-01 00:26:14,630 INFO L226 Difference]: Without dead ends: 769 [2018-10-01 00:26:14,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:26:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-01 00:26:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 554. [2018-10-01 00:26:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-01 00:26:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 789 transitions. [2018-10-01 00:26:14,870 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 789 transitions. Word has length 18 [2018-10-01 00:26:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:14,870 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 789 transitions. [2018-10-01 00:26:14,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 789 transitions. [2018-10-01 00:26:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:14,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:14,871 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:14,872 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:14,872 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-01 00:26:14,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:14,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:15,243 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:15,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:15,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:15,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:15,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:15,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-01 00:26:15,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:26:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:26:15,368 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:15,368 INFO L87 Difference]: Start difference. First operand 554 states and 789 transitions. Second operand 11 states. [2018-10-01 00:26:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:18,191 INFO L93 Difference]: Finished difference Result 776 states and 1098 transitions. [2018-10-01 00:26:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:18,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-01 00:26:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:18,197 INFO L225 Difference]: With dead ends: 776 [2018-10-01 00:26:18,197 INFO L226 Difference]: Without dead ends: 774 [2018-10-01 00:26:18,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:26:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-10-01 00:26:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 563. [2018-10-01 00:26:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-01 00:26:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 802 transitions. [2018-10-01 00:26:18,410 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 802 transitions. Word has length 18 [2018-10-01 00:26:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:18,411 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 802 transitions. [2018-10-01 00:26:18,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:26:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 802 transitions. [2018-10-01 00:26:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:18,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:18,412 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:18,412 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:18,412 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-01 00:26:18,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:18,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:18,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:18,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:18,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:18,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:18,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:18,748 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:26:18,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-01 00:26:18,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:18,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:18,748 INFO L87 Difference]: Start difference. First operand 563 states and 802 transitions. Second operand 13 states. [2018-10-01 00:26:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:22,744 INFO L93 Difference]: Finished difference Result 1451 states and 2064 transitions. [2018-10-01 00:26:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:26:22,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:22,747 INFO L225 Difference]: With dead ends: 1451 [2018-10-01 00:26:22,747 INFO L226 Difference]: Without dead ends: 890 [2018-10-01 00:26:22,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:26:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-10-01 00:26:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 631. [2018-10-01 00:26:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-01 00:26:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 907 transitions. [2018-10-01 00:26:22,961 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 907 transitions. Word has length 18 [2018-10-01 00:26:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:22,962 INFO L480 AbstractCegarLoop]: Abstraction has 631 states and 907 transitions. [2018-10-01 00:26:22,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 907 transitions. [2018-10-01 00:26:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:22,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:22,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:22,963 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:22,964 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-01 00:26:22,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:22,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:23,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:23,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:23,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:23,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:23,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-01 00:26:23,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:23,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:23,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:23,298 INFO L87 Difference]: Start difference. First operand 631 states and 907 transitions. Second operand 13 states. [2018-10-01 00:26:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:24,986 INFO L93 Difference]: Finished difference Result 759 states and 1092 transitions. [2018-10-01 00:26:24,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:26:24,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:24,989 INFO L225 Difference]: With dead ends: 759 [2018-10-01 00:26:24,989 INFO L226 Difference]: Without dead ends: 757 [2018-10-01 00:26:24,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:26:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-01 00:26:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 663. [2018-10-01 00:26:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-01 00:26:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 954 transitions. [2018-10-01 00:26:25,183 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 954 transitions. Word has length 18 [2018-10-01 00:26:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:25,183 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 954 transitions. [2018-10-01 00:26:25,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 954 transitions. [2018-10-01 00:26:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:25,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:25,185 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:25,185 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:25,185 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-01 00:26:25,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:25,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:25,299 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:25,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:25,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:25,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:26,057 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:26:26,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-01 00:26:26,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:26,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:26,057 INFO L87 Difference]: Start difference. First operand 663 states and 954 transitions. Second operand 13 states. [2018-10-01 00:26:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:33,288 INFO L93 Difference]: Finished difference Result 2364 states and 3378 transitions. [2018-10-01 00:26:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:26:33,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:33,294 INFO L225 Difference]: With dead ends: 2364 [2018-10-01 00:26:33,294 INFO L226 Difference]: Without dead ends: 1543 [2018-10-01 00:26:33,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:26:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2018-10-01 00:26:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1109. [2018-10-01 00:26:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-10-01 00:26:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1585 transitions. [2018-10-01 00:26:33,648 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1585 transitions. Word has length 18 [2018-10-01 00:26:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:33,648 INFO L480 AbstractCegarLoop]: Abstraction has 1109 states and 1585 transitions. [2018-10-01 00:26:33,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1585 transitions. [2018-10-01 00:26:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:33,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:33,649 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:33,650 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:33,650 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-01 00:26:33,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:33,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:33,919 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:33,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:34,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:34,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-01 00:26:34,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:26:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:26:34,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:34,058 INFO L87 Difference]: Start difference. First operand 1109 states and 1585 transitions. Second operand 11 states. [2018-10-01 00:26:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:36,848 INFO L93 Difference]: Finished difference Result 1491 states and 2122 transitions. [2018-10-01 00:26:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:36,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-01 00:26:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:36,855 INFO L225 Difference]: With dead ends: 1491 [2018-10-01 00:26:36,855 INFO L226 Difference]: Without dead ends: 1489 [2018-10-01 00:26:36,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2018-10-01 00:26:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1182. [2018-10-01 00:26:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-10-01 00:26:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1691 transitions. [2018-10-01 00:26:37,245 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1691 transitions. Word has length 18 [2018-10-01 00:26:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:37,246 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1691 transitions. [2018-10-01 00:26:37,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:26:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1691 transitions. [2018-10-01 00:26:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:37,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:37,247 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:37,247 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:37,247 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-01 00:26:37,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:37,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:37,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:37,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:37,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:37,755 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:26:37,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-01 00:26:37,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:26:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:26:37,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:37,756 INFO L87 Difference]: Start difference. First operand 1182 states and 1691 transitions. Second operand 13 states. [2018-10-01 00:26:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:41,623 INFO L93 Difference]: Finished difference Result 2458 states and 3522 transitions. [2018-10-01 00:26:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:26:41,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-01 00:26:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:41,628 INFO L225 Difference]: With dead ends: 2458 [2018-10-01 00:26:41,628 INFO L226 Difference]: Without dead ends: 1214 [2018-10-01 00:26:41,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:26:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-10-01 00:26:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 899. [2018-10-01 00:26:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-01 00:26:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1284 transitions. [2018-10-01 00:26:41,944 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1284 transitions. Word has length 18 [2018-10-01 00:26:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:41,944 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1284 transitions. [2018-10-01 00:26:41,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:26:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1284 transitions. [2018-10-01 00:26:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:26:41,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:41,945 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:41,946 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:41,946 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1427971487, now seen corresponding path program 2 times [2018-10-01 00:26:41,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:42,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:42,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:42,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:26:42,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:26:42,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:42,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:42,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:42,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-10-01 00:26:42,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:26:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:26:42,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:42,323 INFO L87 Difference]: Start difference. First operand 899 states and 1284 transitions. Second operand 16 states. [2018-10-01 00:26:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:48,244 INFO L93 Difference]: Finished difference Result 1269 states and 1781 transitions. [2018-10-01 00:26:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:26:48,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-01 00:26:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:48,249 INFO L225 Difference]: With dead ends: 1269 [2018-10-01 00:26:48,249 INFO L226 Difference]: Without dead ends: 1267 [2018-10-01 00:26:48,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:26:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2018-10-01 00:26:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1020. [2018-10-01 00:26:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-01 00:26:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1448 transitions. [2018-10-01 00:26:48,619 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1448 transitions. Word has length 18 [2018-10-01 00:26:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:48,619 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 1448 transitions. [2018-10-01 00:26:48,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:26:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1448 transitions. [2018-10-01 00:26:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:26:48,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:48,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:48,621 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:48,621 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-01 00:26:48,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:48,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:48,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:48,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:48,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:48,896 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:48,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-01 00:26:48,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:26:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:26:48,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:48,897 INFO L87 Difference]: Start difference. First operand 1020 states and 1448 transitions. Second operand 11 states. [2018-10-01 00:26:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:53,142 INFO L93 Difference]: Finished difference Result 1268 states and 1784 transitions. [2018-10-01 00:26:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:26:53,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-01 00:26:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:53,149 INFO L225 Difference]: With dead ends: 1268 [2018-10-01 00:26:53,149 INFO L226 Difference]: Without dead ends: 1266 [2018-10-01 00:26:53,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:26:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2018-10-01 00:26:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1074. [2018-10-01 00:26:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-10-01 00:26:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1527 transitions. [2018-10-01 00:26:53,522 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1527 transitions. Word has length 22 [2018-10-01 00:26:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:53,522 INFO L480 AbstractCegarLoop]: Abstraction has 1074 states and 1527 transitions. [2018-10-01 00:26:53,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:26:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1527 transitions. [2018-10-01 00:26:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:26:53,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:53,524 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:53,524 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:53,524 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-01 00:26:53,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:53,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:53,637 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:53,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:53,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:53,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:54,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:54,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-01 00:26:54,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:26:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:26:54,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:54,241 INFO L87 Difference]: Start difference. First operand 1074 states and 1527 transitions. Second operand 11 states. [2018-10-01 00:26:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:56,554 INFO L93 Difference]: Finished difference Result 1139 states and 1607 transitions. [2018-10-01 00:26:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:26:56,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-01 00:26:56,555 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2018-10-01 00:26:56,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-01 00:26:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:56,555 FATAL L834 BasicCegarLoop]: -- [2018-10-01 00:26:56,555 FATAL L835 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2018-10-01 00:26:56,555 FATAL L836 BasicCegarLoop]: word: [2018-10-01 00:26:56,555 FATAL L838 BasicCegarLoop]: havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1; [2018-10-01 00:26:56,558 FATAL L838 BasicCegarLoop]: call l0l0(); [2018-10-01 00:26:56,558 FATAL L838 BasicCegarLoop]: begin0 := next;next := next + workload;end0 := next;iter0 := begin0; [2018-10-01 00:26:56,558 FATAL L838 BasicCegarLoop]: assume iter0 < end0; [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: call l1l0(); [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: working0 := iter0; [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: assume working0 != working1;iter0 := iter0 + 1; [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: assume iter0 < end0; [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: call l1l0(); [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: begin1 := next;next := next + workload;end1 := next;iter1 := begin1; [2018-10-01 00:26:56,559 FATAL L838 BasicCegarLoop]: assume iter1 < end1; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: call l1l1(); [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: working0 := iter0; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: assume working0 != working1;iter0 := iter0 + 1; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: assume !(iter0 < end0); [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: call l0l1(); [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: working1 := iter1; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: assume working0 != working1;iter1 := iter1 + 1; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: assume iter1 < end1; [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: call l0l1(); [2018-10-01 00:26:56,560 FATAL L838 BasicCegarLoop]: working1 := iter1; [2018-10-01 00:26:56,561 FATAL L838 BasicCegarLoop]: assume !(working0 != working1); [2018-10-01 00:26:56,561 FATAL L840 BasicCegarLoop]: original automaton: [2018-10-01 00:26:56,561 FATAL L841 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call l1l1();" "call l1l0();" "call l1l0();" "call l0l0();" "call l1l1();" "call l1l0();" "call l1l1();" "call l0l1();" "call l0l1();" "call l0l0();" "call l1l0();" "call l0l0();" "call l0l1();" "call l0l0();" "call l0l0();" "call l1l1();" "call l0l1();" }, internalAlphabet = {"working0 := iter0;" "assume !(working0 != working1);" "assume working0 != working1;iter0 := iter0 + 1;" "assume iter0 < end0;" "SUMMARY for null srcloc: L69" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L71" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L79" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L81" "assume true;" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "assume iter0 < end0;" "SUMMARY for null srcloc: L93" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L95" "working1 := iter1;" "assume !(working0 != working1);" "assume working0 != working1;iter1 := iter1 + 1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L102" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L104" "assume true;" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "assume iter0 < end0;" "SUMMARY for null srcloc: L46" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L48" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L56" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L58" "assume true;" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "SUMMARY for null srcloc: L36" "assume true;" "working0 := iter0;" "assume !(working0 != working1);" "assume working0 != working1;iter0 := iter0 + 1;" "assume iter0 < end0;" "SUMMARY for null srcloc: L115" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L117" "working1 := iter1;" "assume !(working0 != working1);" "assume working0 != working1;iter1 := iter1 + 1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L124" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L126" "assume true;" }, returnAlphabet = {"#128#return;" "#130#return;" "#100#return;" "#132#return;" "#102#return;" "#104#return;" "#106#return;" "#108#return;" "#110#return;" "#112#return;" "#114#return;" "#116#return;" "#118#return;" "#120#return;" "#122#return;" "#124#return;" "#126#return;" }, states = {"49856#(<= (+ iter0 1) next)" "49936#(<= (+ working0 2) iter1)" "49858#(<= (+ iter0 1) iter1)" "49860#(<= (+ working0 1) iter1)" "49862#(not (= iter1 working0))" "49864#(not (= working1 working0))" "49851#true" "49852#false" "49916#(<= (+ working0 1) iter1)" "49948#(<= (+ working0 2) working1)" "49854#(<= end0 next)" }, initialStates = {"49851#true" }, finalStates = {"49852#false" }, callTransitions = { ("49856#(<= (+ iter0 1) next)" "call l1l0();" "49856#(<= (+ iter0 1) next)") ("49936#(<= (+ working0 2) iter1)" "call l0l1();" "49936#(<= (+ working0 2) iter1)") ("49858#(<= (+ iter0 1) iter1)" "call l1l1();" "49858#(<= (+ iter0 1) iter1)") ("49860#(<= (+ working0 1) iter1)" "call l0l1();" "49860#(<= (+ working0 1) iter1)") ("49862#(not (= iter1 working0))" "call l0l1();" "49862#(not (= iter1 working0))") ("49851#true" "call l0l0();" "49851#true") ("49916#(<= (+ working0 1) iter1)" "call l0l1();" "49916#(<= (+ working0 1) iter1)") ("49854#(<= end0 next)" "call l1l0();" "49854#(<= end0 next)") }, internalTransitions = { ("49856#(<= (+ iter0 1) next)" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49858#(<= (+ iter0 1) iter1)") ("49936#(<= (+ working0 2) iter1)" "working1 := iter1;" "49948#(<= (+ working0 2) working1)") ("49936#(<= (+ working0 2) iter1)" "assume iter1 < end1;" "49936#(<= (+ working0 2) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume iter1 < end1;" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "working0 := iter0;" "49860#(<= (+ working0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "working0 := iter0;" "49916#(<= (+ working0 1) iter1)") ("49860#(<= (+ working0 1) iter1)" "assume !(iter0 < end0);" "49860#(<= (+ working0 1) iter1)") ("49860#(<= (+ working0 1) iter1)" "working1 := iter1;" "49860#(<= (+ working0 1) iter1)") ("49860#(<= (+ working0 1) iter1)" "assume working0 != working1;iter1 := iter1 + 1;" "49862#(not (= iter1 working0))") ("49860#(<= (+ working0 1) iter1)" "assume working0 != working1;iter0 := iter0 + 1;" "49860#(<= (+ working0 1) iter1)") ("49862#(not (= iter1 working0))" "working1 := iter1;" "49864#(not (= working1 working0))") ("49862#(not (= iter1 working0))" "assume iter1 < end1;" "49862#(not (= iter1 working0))") ("49864#(not (= working1 working0))" "assume !(working0 != working1);" "49852#false") ("49851#true" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49854#(<= end0 next)") ("49851#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "49851#true") ("49916#(<= (+ working0 1) iter1)" "assume !(iter0 < end0);" "49916#(<= (+ working0 1) iter1)") ("49916#(<= (+ working0 1) iter1)" "working1 := iter1;" "49916#(<= (+ working0 1) iter1)") ("49916#(<= (+ working0 1) iter1)" "assume working0 != working1;iter1 := iter1 + 1;" "49936#(<= (+ working0 2) iter1)") ("49916#(<= (+ working0 1) iter1)" "assume working0 != working1;iter0 := iter0 + 1;" "49916#(<= (+ working0 1) iter1)") ("49948#(<= (+ working0 2) working1)" "assume !(working0 != working1);" "49852#false") ("49854#(<= end0 next)" "working0 := iter0;" "49854#(<= end0 next)") ("49854#(<= end0 next)" "assume working0 != working1;iter0 := iter0 + 1;" "49854#(<= end0 next)") ("49854#(<= end0 next)" "assume iter0 < end0;" "49854#(<= end0 next)") ("49854#(<= end0 next)" "assume iter0 < end0;" "49856#(<= (+ iter0 1) next)") }, returnTransitions = { } ); [2018-10-01 00:26:56,567 FATAL L842 BasicCegarLoop]: enhanced automaton: [2018-10-01 00:26:56,567 FATAL L843 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call l1l1();" "call l1l0();" "call l1l0();" "call l0l0();" "call l1l1();" "call l1l0();" "call l1l1();" "call l0l1();" "call l0l1();" "call l0l0();" "call l1l0();" "call l0l0();" "call l0l1();" "call l0l0();" "call l0l0();" "call l1l1();" "call l0l1();" }, internalAlphabet = {"working0 := iter0;" "assume !(working0 != working1);" "assume working0 != working1;iter0 := iter0 + 1;" "assume iter0 < end0;" "SUMMARY for null srcloc: L69" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L71" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L79" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L81" "assume true;" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "assume iter0 < end0;" "SUMMARY for null srcloc: L93" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L95" "working1 := iter1;" "assume !(working0 != working1);" "assume working0 != working1;iter1 := iter1 + 1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L102" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L104" "assume true;" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "assume iter0 < end0;" "SUMMARY for null srcloc: L46" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L48" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L56" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L58" "assume true;" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "SUMMARY for null srcloc: L36" "assume true;" "working0 := iter0;" "assume !(working0 != working1);" "assume working0 != working1;iter0 := iter0 + 1;" "assume iter0 < end0;" "SUMMARY for null srcloc: L115" "assume !(iter0 < end0);" "SUMMARY for null srcloc: L117" "working1 := iter1;" "assume !(working0 != working1);" "assume working0 != working1;iter1 := iter1 + 1;" "assume iter1 < end1;" "SUMMARY for null srcloc: L124" "assume !(iter1 < end1);" "SUMMARY for null srcloc: L126" "assume true;" }, returnAlphabet = {"#128#return;" "#130#return;" "#100#return;" "#132#return;" "#102#return;" "#104#return;" "#106#return;" "#108#return;" "#110#return;" "#112#return;" "#114#return;" "#116#return;" "#118#return;" "#120#return;" "#122#return;" "#124#return;" "#126#return;" }, states = {"49858#(<= (+ iter0 1) iter1)" "49971#(and (not (= working1 working0)) (<= end0 next))" "49957#(and (<= end0 next) (<= (+ iter0 1) next))" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "49864#(not (= working1 working0))" "49851#true" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "49854#(<= end0 next)" }, initialStates = {"49851#true" }, finalStates = {}, callTransitions = { ("49858#(<= (+ iter0 1) iter1)" "call l1l1();" "49858#(<= (+ iter0 1) iter1)") ("49971#(and (not (= working1 working0)) (<= end0 next))" "call l0l0();" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "call l0l0();" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "call l0l1();" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "call l0l1();" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "call l1l0();" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "call l1l1();" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "call l1l1();" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "call l1l0();" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "call l1l1();" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("49864#(not (= working1 working0))" "call l0l0();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l1l1();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l1l0();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l1l0();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l0l0();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l0l1();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l1l1();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l1l1();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l0l1();" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "call l0l1();" "49864#(not (= working1 working0))") ("49851#true" "call l0l1();" "49851#true") ("49851#true" "call l0l0();" "49851#true") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l1();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l0();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l0();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l0();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l1();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "call l1l1();" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") }, internalTransitions = { ("49858#(<= (+ iter0 1) iter1)" "assume iter1 < end1;" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume !(working0 != working1);" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume working0 != working1;iter0 := iter0 + 1;" "49864#(not (= working1 working0))") ("49858#(<= (+ iter0 1) iter1)" "working1 := iter1;" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume working0 != working1;iter1 := iter1 + 1;" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("49858#(<= (+ iter0 1) iter1)" "working0 := iter0;" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume !(working0 != working1);" "49858#(<= (+ iter0 1) iter1)") ("49858#(<= (+ iter0 1) iter1)" "assume working0 != working1;iter0 := iter0 + 1;" "49864#(not (= working1 working0))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume iter0 < end0;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume !(iter0 < end0);" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "working1 := iter1;" "49854#(<= end0 next)") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume iter0 < end0;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume iter0 < end0;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume iter1 < end1;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume !(iter0 < end0);" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49864#(not (= working1 working0))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume !(iter1 < end1);" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49971#(and (not (= working1 working0)) (<= end0 next))" "assume iter0 < end0;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "working0 := iter0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "assume !(working0 != working1);" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "assume working0 != working1;iter0 := iter0 + 1;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "working1 := iter1;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "assume !(working0 != working1);" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "assume working0 != working1;iter1 := iter1 + 1;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "working0 := iter0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "assume working0 != working1;iter0 := iter0 + 1;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49957#(and (<= end0 next) (<= (+ iter0 1) next))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49858#(<= (+ iter0 1) iter1)") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "assume iter1 < end1;" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "working0 := iter0;" "49858#(<= (+ iter0 1) iter1)") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "working1 := iter1;" "49858#(<= (+ iter0 1) iter1)") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "working0 := iter0;" "49858#(<= (+ iter0 1) iter1)") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "assume iter1 < end1;" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49864#(not (= working1 working0))") ("50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))" "assume !(iter1 < end1);" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("49864#(not (= working1 working0))" "working0 := iter0;" "49851#true") ("49864#(not (= working1 working0))" "working1 := iter1;" "49851#true") ("49864#(not (= working1 working0))" "assume iter0 < end0;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume iter1 < end1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume !(iter0 < end0);" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "working0 := iter0;" "49851#true") ("49864#(not (= working1 working0))" "assume !(iter1 < end1);" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume iter0 < end0;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume iter1 < end1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49864#(not (= working1 working0))" "assume !(iter0 < end0);" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "working1 := iter1;" "49851#true") ("49864#(not (= working1 working0))" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49864#(not (= working1 working0))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume iter1 < end1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume iter1 < end1;" "49864#(not (= working1 working0))") ("49864#(not (= working1 working0))" "assume !(iter1 < end1);" "49864#(not (= working1 working0))") ("49851#true" "assume !(working0 != working1);" "49851#true") ("49851#true" "working1 := iter1;" "49851#true") ("49851#true" "assume working0 != working1;iter0 := iter0 + 1;" "49864#(not (= working1 working0))") ("49851#true" "assume !(working0 != working1);" "49851#true") ("49851#true" "havoc next;assume next >= 0;havoc workload;assume workload > 0;working0 := -1;working1 := -1;" "49851#true") ("49851#true" "assume working0 != working1;iter1 := iter1 + 1;" "49864#(not (= working1 working0))") ("49851#true" "assume !(working0 != working1);" "49851#true") ("49851#true" "assume working0 != working1;iter0 := iter0 + 1;" "49864#(not (= working1 working0))") ("49851#true" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49854#(<= end0 next)") ("49851#true" "assume working0 != working1;iter1 := iter1 + 1;" "49864#(not (= working1 working0))") ("49851#true" "begin0 := next;next := next + workload;end0 := next;iter0 := begin0;" "49854#(<= end0 next)") ("49851#true" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "49851#true") ("49851#true" "assume iter1 < end1;" "49851#true") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "working0 := iter0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "working1 := iter1;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "working0 := iter0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "assume iter1 < end1;" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "begin1 := next;next := next + workload;end1 := next;iter1 := begin1;" "50007#(and (not (= working1 working0)) (<= (+ iter0 1) iter1))") ("49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))" "assume !(iter1 < end1);" "49979#(and (not (= working1 working0)) (<= end0 next) (<= (+ iter0 1) next))") ("49854#(<= end0 next)" "assume iter0 < end0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") ("49854#(<= end0 next)" "assume !(working0 != working1);" "49854#(<= end0 next)") ("49854#(<= end0 next)" "assume working0 != working1;iter1 := iter1 + 1;" "49971#(and (not (= working1 working0)) (<= end0 next))") ("49854#(<= end0 next)" "assume iter0 < end0;" "49957#(and (<= end0 next) (<= (+ iter0 1) next))") }, returnTransitions = { } ); [2018-10-01 00:26:56,572 FATAL L844 BasicCegarLoop]: -- [2018-10-01 00:26:56,573 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 30 broken: counterexample of length 23 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-10-01 00:26:56,579 INFO L168 Benchmark]: Toolchain (without parser) took 122744.83 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 313.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 329.6 MB). Peak memory consumption was 643.2 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:56,581 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:56,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:56,582 INFO L168 Benchmark]: Boogie Preprocessor took 23.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:56,582 INFO L168 Benchmark]: RCFGBuilder took 862.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:56,583 INFO L168 Benchmark]: TraceAbstraction took 121807.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 313.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 308.5 MB). Peak memory consumption was 622.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:26:56,587 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.22 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 44.53 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 23.95 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 862.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121807.60 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 313.5 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 308.5 MB). Peak memory consumption was 622.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 30 broken: counterexample of length 23 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 30 broken: counterexample of length 23 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_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-26-56-598.csv Received shutdown request...