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/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:47:11,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:47:11,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:47:11,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:47:11,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:47:11,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:47:11,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:47:11,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:47:11,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:47:11,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:47:11,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:47:11,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:47:11,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:47:11,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:47:11,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:47:11,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:47:11,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:47:11,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:47:11,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:47:11,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:47:11,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:47:11,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:47:11,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:47:11,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:47:11,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:47:11,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:47:11,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:47:11,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:47:11,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:47:11,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:47:11,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:47:11,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:47:11,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:47:11,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:47:11,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:47:11,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:47:11,835 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:47:11,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:47:11,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:47:11,851 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:47:11,851 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:47:11,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:47:11,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:47:11,853 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:47:11,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:47:11,853 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:47:11,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:47:11,853 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:47:11,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:47:11,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:47:11,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:47:11,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:47:11,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:47:11,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:47:11,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:47:11,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:47:11,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:47:11,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:47:11,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:47:11,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:11,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:47:11,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:47:11,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:47:11,857 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:47:11,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:47:11,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:47:11,857 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:47:11,858 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:47:11,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:47:11,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:47:11,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:47:11,932 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:47:11,932 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:47:11,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-09-30 20:47:11,933 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-09-30 20:47:12,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:47:12,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:47:12,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:12,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:47:12,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:47:12,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:12,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:47:12,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:47:12,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:47:12,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... [2018-09-30 20:47:12,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:47:12,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:47:12,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:47:12,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:47:12,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:12,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:47:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:47:12,951 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:47:12,951 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:12 BoogieIcfgContainer [2018-09-30 20:47:12,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:47:12,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:47:12,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:47:12,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:47:12,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:12" (1/2) ... [2018-09-30 20:47:12,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148e44b0 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:47:12, skipping insertion in model container [2018-09-30 20:47:12,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:12" (2/2) ... [2018-09-30 20:47:12,959 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-09-30 20:47:12,969 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:47:12,977 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:47:13,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:47:13,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:47:13,024 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:47:13,024 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:47:13,025 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:47:13,025 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:47:13,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:47:13,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:47:13,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:47:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-09-30 20:47:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:47:13,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:13,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:13,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:13,056 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-09-30 20:47:13,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:13,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:13,294 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:13,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:13,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:13,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:13,316 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-09-30 20:47:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:14,053 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-09-30 20:47:14,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:14,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:47:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:14,069 INFO L225 Difference]: With dead ends: 60 [2018-09-30 20:47:14,069 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 20:47:14,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 20:47:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-30 20:47:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 20:47:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-09-30 20:47:14,111 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-09-30 20:47:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:14,112 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-09-30 20:47:14,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-09-30 20:47:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 20:47:14,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:14,114 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:14,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:14,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-09-30 20:47:14,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:14,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:14,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:14,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:14,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:14,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:14,237 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-09-30 20:47:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:14,995 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-09-30 20:47:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:14,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-30 20:47:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:14,997 INFO L225 Difference]: With dead ends: 87 [2018-09-30 20:47:14,998 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 20:47:14,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 20:47:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-30 20:47:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:47:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-09-30 20:47:15,014 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-09-30 20:47:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-09-30 20:47:15,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-09-30 20:47:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 20:47:15,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:15,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:15,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:15,017 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-09-30 20:47:15,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:15,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:47:15,117 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:15,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:15,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:15,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:15,118 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-09-30 20:47:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:15,396 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-09-30 20:47:15,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:15,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-30 20:47:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:15,398 INFO L225 Difference]: With dead ends: 110 [2018-09-30 20:47:15,398 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 20:47:15,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 20:47:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 20:47:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 20:47:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-09-30 20:47:15,412 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-09-30 20:47:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:15,412 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-09-30 20:47:15,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-09-30 20:47:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 20:47:15,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:15,414 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:15,414 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:15,415 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-09-30 20:47:15,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:15,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:15,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:15,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:15,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:15,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:15,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:15,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:15,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:15,488 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-09-30 20:47:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:15,873 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-09-30 20:47:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:15,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-09-30 20:47:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:15,876 INFO L225 Difference]: With dead ends: 135 [2018-09-30 20:47:15,876 INFO L226 Difference]: Without dead ends: 76 [2018-09-30 20:47:15,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-30 20:47:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-30 20:47:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 20:47:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-09-30 20:47:15,894 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-09-30 20:47:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-09-30 20:47:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-09-30 20:47:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-30 20:47:15,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:15,897 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:15,897 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:15,898 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-09-30 20:47:15,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-30 20:47:16,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:16,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:16,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:16,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:16,016 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-09-30 20:47:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:16,205 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-09-30 20:47:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:16,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-30 20:47:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:16,209 INFO L225 Difference]: With dead ends: 157 [2018-09-30 20:47:16,210 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 20:47:16,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 20:47:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-30 20:47:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 20:47:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-09-30 20:47:16,226 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-09-30 20:47:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-09-30 20:47:16,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-09-30 20:47:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 20:47:16,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:16,228 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:16,229 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:16,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-09-30 20:47:16,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-30 20:47:16,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:16,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:16,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:16,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:16,324 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-09-30 20:47:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:16,516 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-09-30 20:47:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:16,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 20:47:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:16,518 INFO L225 Difference]: With dead ends: 168 [2018-09-30 20:47:16,518 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 20:47:16,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 20:47:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-30 20:47:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 20:47:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-09-30 20:47:16,537 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-09-30 20:47:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:16,537 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-09-30 20:47:16,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-09-30 20:47:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:47:16,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:16,539 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:16,539 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:16,540 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-09-30 20:47:16,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:16,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:16,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:16,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 20:47:16,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:16,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:16,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:16,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:16,596 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-09-30 20:47:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:17,055 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-09-30 20:47:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:17,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 20:47:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:17,058 INFO L225 Difference]: With dead ends: 185 [2018-09-30 20:47:17,058 INFO L226 Difference]: Without dead ends: 98 [2018-09-30 20:47:17,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-30 20:47:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-30 20:47:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 20:47:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-09-30 20:47:17,088 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-09-30 20:47:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:17,088 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-09-30 20:47:17,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-09-30 20:47:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 20:47:17,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:17,093 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:17,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:17,094 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-09-30 20:47:17,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-30 20:47:17,227 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:17,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:17,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:17,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:17,228 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-09-30 20:47:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:17,514 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-09-30 20:47:17,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:17,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-09-30 20:47:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:17,516 INFO L225 Difference]: With dead ends: 285 [2018-09-30 20:47:17,516 INFO L226 Difference]: Without dead ends: 188 [2018-09-30 20:47:17,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-30 20:47:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-30 20:47:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-30 20:47:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-09-30 20:47:17,545 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-09-30 20:47:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:17,545 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-09-30 20:47:17,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-09-30 20:47:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 20:47:17,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:17,548 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:17,548 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:17,548 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-09-30 20:47:17,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:47:17,662 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:17,663 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:47:17,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 20:47:18,933 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:18,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:18,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:18,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:18,935 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-09-30 20:47:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:21,815 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-09-30 20:47:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:47:21,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-09-30 20:47:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:21,822 INFO L225 Difference]: With dead ends: 695 [2018-09-30 20:47:21,822 INFO L226 Difference]: Without dead ends: 486 [2018-09-30 20:47:21,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-09-30 20:47:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-30 20:47:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-09-30 20:47:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-30 20:47:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-09-30 20:47:21,866 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-09-30 20:47:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:21,867 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-09-30 20:47:21,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-09-30 20:47:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 20:47:21,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:21,870 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:21,870 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:21,870 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:21,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-09-30 20:47:21,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:21,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:21,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-30 20:47:21,967 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:21,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:21,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:21,968 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-09-30 20:47:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:22,299 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-09-30 20:47:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:22,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 20:47:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:22,301 INFO L225 Difference]: With dead ends: 466 [2018-09-30 20:47:22,301 INFO L226 Difference]: Without dead ends: 279 [2018-09-30 20:47:22,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-30 20:47:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-30 20:47:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-30 20:47:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-09-30 20:47:22,334 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-09-30 20:47:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:22,334 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-09-30 20:47:22,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-09-30 20:47:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-30 20:47:22,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:22,336 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:22,336 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:22,336 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-09-30 20:47:22,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-30 20:47:22,402 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:22,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:22,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:22,403 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-09-30 20:47:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:22,545 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-09-30 20:47:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:22,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-09-30 20:47:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:22,553 INFO L225 Difference]: With dead ends: 464 [2018-09-30 20:47:22,554 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 20:47:22,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 20:47:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-09-30 20:47:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 20:47:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-09-30 20:47:22,595 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-09-30 20:47:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:22,595 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-09-30 20:47:22,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-09-30 20:47:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-30 20:47:22,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:22,597 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:22,597 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:22,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-09-30 20:47:22,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:22,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-09-30 20:47:22,728 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:22,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:22,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:22,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:22,730 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-09-30 20:47:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:23,040 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-09-30 20:47:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:23,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-30 20:47:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:23,044 INFO L225 Difference]: With dead ends: 548 [2018-09-30 20:47:23,044 INFO L226 Difference]: Without dead ends: 276 [2018-09-30 20:47:23,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-30 20:47:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-09-30 20:47:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-30 20:47:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-09-30 20:47:23,076 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-09-30 20:47:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:23,077 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-09-30 20:47:23,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-09-30 20:47:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-30 20:47:23,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:23,078 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:23,078 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:23,078 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-09-30 20:47:23,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:23,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:23,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:23,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-30 20:47:23,180 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:23,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:23,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:23,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:23,181 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-09-30 20:47:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:23,825 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-09-30 20:47:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:23,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-09-30 20:47:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:23,827 INFO L225 Difference]: With dead ends: 543 [2018-09-30 20:47:23,827 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 20:47:23,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 20:47:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-09-30 20:47:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-30 20:47:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-09-30 20:47:23,861 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-09-30 20:47:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:23,862 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-09-30 20:47:23,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-09-30 20:47:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 20:47:23,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:23,863 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:23,864 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:23,864 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-09-30 20:47:23,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:23,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 20:47:23,984 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:23,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:23,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:23,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:23,986 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-09-30 20:47:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:24,641 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-09-30 20:47:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:24,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-09-30 20:47:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:24,644 INFO L225 Difference]: With dead ends: 543 [2018-09-30 20:47:24,644 INFO L226 Difference]: Without dead ends: 277 [2018-09-30 20:47:24,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-30 20:47:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-30 20:47:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 20:47:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-09-30 20:47:24,675 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-09-30 20:47:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:24,676 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-09-30 20:47:24,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-09-30 20:47:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-30 20:47:24,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:24,677 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:24,677 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:24,677 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-09-30 20:47:24,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-09-30 20:47:24,788 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:24,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:24,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:24,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:24,789 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-09-30 20:47:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:25,491 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-09-30 20:47:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:25,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-09-30 20:47:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:25,493 INFO L225 Difference]: With dead ends: 576 [2018-09-30 20:47:25,493 INFO L226 Difference]: Without dead ends: 307 [2018-09-30 20:47:25,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-30 20:47:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-30 20:47:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-30 20:47:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-09-30 20:47:25,528 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-09-30 20:47:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:25,528 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-09-30 20:47:25,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-09-30 20:47:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 20:47:25,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:25,530 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:25,531 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:25,531 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-09-30 20:47:25,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:25,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-30 20:47:25,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:25,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:25,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:25,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:25,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:25,667 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-09-30 20:47:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:25,818 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-09-30 20:47:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:25,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-09-30 20:47:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:25,823 INFO L225 Difference]: With dead ends: 606 [2018-09-30 20:47:25,823 INFO L226 Difference]: Without dead ends: 403 [2018-09-30 20:47:25,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-30 20:47:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-30 20:47:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 20:47:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-09-30 20:47:25,874 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-09-30 20:47:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:25,874 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-09-30 20:47:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-09-30 20:47:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-30 20:47:25,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:25,878 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:25,878 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:25,879 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-09-30 20:47:25,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:25,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-09-30 20:47:26,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:26,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:26,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:26,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:26,048 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-09-30 20:47:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:26,290 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-09-30 20:47:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:26,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-09-30 20:47:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:26,292 INFO L225 Difference]: With dead ends: 798 [2018-09-30 20:47:26,292 INFO L226 Difference]: Without dead ends: 403 [2018-09-30 20:47:26,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-30 20:47:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-09-30 20:47:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-30 20:47:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-09-30 20:47:26,349 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-09-30 20:47:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:26,349 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-09-30 20:47:26,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-09-30 20:47:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-30 20:47:26,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:26,352 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:26,353 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:26,353 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-09-30 20:47:26,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 20:47:26,621 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:26,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:47:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:26,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-09-30 20:47:27,394 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:27,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:27,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:27,395 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-09-30 20:47:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:27,705 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-09-30 20:47:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:27,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-09-30 20:47:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:27,712 INFO L225 Difference]: With dead ends: 643 [2018-09-30 20:47:27,712 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:47:27,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:47:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:47:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:47:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:47:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:47:27,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-09-30 20:47:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:27,715 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:47:27,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:47:27,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:47:27,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:47:27,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:27,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:28,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:29,296 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-30 20:47:29,883 WARN L178 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-30 20:47:30,049 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-30 20:47:30,275 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-30 20:47:30,519 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-30 20:47:30,694 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-09-30 20:47:30,919 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-09-30 20:47:31,133 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-30 20:47:31,283 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-09-30 20:47:31,567 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-09-30 20:47:32,001 WARN L178 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-09-30 20:47:32,318 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-09-30 20:47:32,471 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-09-30 20:47:32,500 INFO L422 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-30 20:47:32,501 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,501 INFO L422 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-30 20:47:32,501 INFO L422 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-30 20:47:32,501 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-30 20:47:32,501 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-09-30 20:47:32,502 INFO L422 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,502 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-09-30 20:47:32,502 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-30 20:47:32,502 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-30 20:47:32,502 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-09-30 20:47:32,502 INFO L422 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,502 INFO L422 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,502 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-30 20:47:32,503 INFO L422 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5))) [2018-09-30 20:47:32,503 INFO L422 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,503 INFO L422 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-30 20:47:32,503 INFO L422 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,503 INFO L422 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)))) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-09-30 20:47:32,504 INFO L422 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-09-30 20:47:32,523 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:47:32 BoogieIcfgContainer [2018-09-30 20:47:32,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:47:32,524 INFO L168 Benchmark]: Toolchain (without parser) took 20504.42 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 449.6 MB). Peak memory consumption was 558.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:32,525 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:32,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.75 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:32,526 INFO L168 Benchmark]: Boogie Preprocessor took 48.29 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:32,527 INFO L168 Benchmark]: RCFGBuilder took 825.75 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:32,530 INFO L168 Benchmark]: TraceAbstraction took 19570.28 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 417.9 MB). Peak memory consumption was 527.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:32,534 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.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.75 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.29 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 825.75 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19570.28 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 417.9 MB). Peak memory consumption was 527.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 19.4s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-47-32-554.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-47-32-554.csv Received shutdown request...