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_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:38,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:38,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:38,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:38,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:38,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:38,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:38,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:38,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:38,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:38,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:38,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:38,118 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:38,119 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:38,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:38,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:38,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:38,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:38,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:38,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:38,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:38,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:38,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:38,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:38,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:38,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:38,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:38,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:38,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:38,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:38,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:38,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:38,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:38,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:38,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:38,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:38,151 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-26 21:53:38,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:38,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:38,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:38,184 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:38,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:38,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:38,185 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:38,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:38,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:38,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:38,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:38,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:38,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:38,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:38,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:38,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:38,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:38,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:38,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:38,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:38,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:38,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:38,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:38,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:38,195 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:38,195 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:38,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:38,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:38,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:38,286 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:38,286 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:38,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-26 21:53:38,287 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-09-26 21:53:38,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:38,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:38,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:38,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:38,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:38,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:38,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:38,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:38,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:38,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/1) ... [2018-09-26 21:53:38,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:38,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:38,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:38,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:38,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (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-26 21:53:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:38,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:39,154 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:39,155 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:39 BoogieIcfgContainer [2018-09-26 21:53:39,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:39,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:39,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:39,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:39,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:38" (1/2) ... [2018-09-26 21:53:39,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2772e5 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:39, skipping insertion in model container [2018-09-26 21:53:39,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:39" (2/2) ... [2018-09-26 21:53:39,165 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-26 21:53:39,176 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:39,184 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:39,235 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:39,236 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:39,236 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:39,236 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:39,237 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:39,237 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:39,237 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:39,237 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:39,237 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-26 21:53:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:53:39,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:39,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:39,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:39,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-09-26 21:53:39,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:39,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,463 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-26 21:53:39,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:39,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,485 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-26 21:53:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,966 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-09-26 21:53:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:39,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 21:53:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,981 INFO L225 Difference]: With dead ends: 37 [2018-09-26 21:53:39,982 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:53:39,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:53:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 21:53:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 21:53:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-09-26 21:53:40,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-09-26 21:53:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:40,026 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-09-26 21:53:40,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-09-26 21:53:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:53:40,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:40,027 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:40,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:40,028 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-09-26 21:53:40,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:40,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:40,105 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:40,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:40,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:40,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:40,108 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-09-26 21:53:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:40,387 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-09-26 21:53:40,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:40,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 21:53:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:40,390 INFO L225 Difference]: With dead ends: 41 [2018-09-26 21:53:40,390 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 21:53:40,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 21:53:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 21:53:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 21:53:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-09-26 21:53:40,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-09-26 21:53:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:40,399 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-09-26 21:53:40,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-09-26 21:53:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:53:40,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:40,400 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:40,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:40,401 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-09-26 21:53:40,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:53:40,541 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:40,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:40,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:40,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:40,543 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-09-26 21:53:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:41,007 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-09-26 21:53:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:41,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:53:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:41,008 INFO L225 Difference]: With dead ends: 50 [2018-09-26 21:53:41,009 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 21:53:41,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 21:53:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 21:53:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:53:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-09-26 21:53:41,016 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-09-26 21:53:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:41,017 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-09-26 21:53:41,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-09-26 21:53:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:53:41,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:41,018 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:41,019 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:41,019 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-09-26 21:53:41,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:53:41,117 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:41,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:41,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:41,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:41,119 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-09-26 21:53:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:41,359 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-09-26 21:53:41,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:41,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-26 21:53:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:41,362 INFO L225 Difference]: With dead ends: 74 [2018-09-26 21:53:41,362 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 21:53:41,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 21:53:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-09-26 21:53:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 21:53:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-09-26 21:53:41,378 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-09-26 21:53:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:41,379 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-09-26 21:53:41,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-09-26 21:53:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:53:41,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:41,382 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:41,382 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:41,383 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-09-26 21:53:41,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:41,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:41,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:53:41,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:41,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:41,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:41,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:41,535 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-09-26 21:53:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:41,793 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-09-26 21:53:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:41,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:53:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:41,795 INFO L225 Difference]: With dead ends: 92 [2018-09-26 21:53:41,795 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 21:53:41,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 21:53:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 21:53:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:53:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-09-26 21:53:41,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-09-26 21:53:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:41,808 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-09-26 21:53:41,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-09-26 21:53:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 21:53:41,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:41,810 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:41,810 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:41,810 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-09-26 21:53:41,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:41,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:41,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:41,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:41,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:41,881 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:41,881 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-09-26 21:53:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:42,011 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-09-26 21:53:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:42,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-09-26 21:53:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:42,016 INFO L225 Difference]: With dead ends: 71 [2018-09-26 21:53:42,016 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:53:42,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:53:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-09-26 21:53:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 21:53:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-09-26 21:53:42,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-09-26 21:53:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:42,028 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-09-26 21:53:42,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-09-26 21:53:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:53:42,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:42,030 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:42,030 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:42,030 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-09-26 21:53:42,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:42,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:42,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:42,125 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:42,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:42,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:42,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:42,127 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-09-26 21:53:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:42,499 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-09-26 21:53:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:42,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 21:53:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:42,502 INFO L225 Difference]: With dead ends: 161 [2018-09-26 21:53:42,502 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 21:53:42,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 21:53:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 21:53:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 21:53:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-09-26 21:53:42,519 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-09-26 21:53:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:42,519 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-09-26 21:53:42,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-09-26 21:53:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 21:53:42,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:42,522 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:42,522 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:42,522 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-09-26 21:53:42,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:42,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-26 21:53:42,604 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:42,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:42,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:42,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:42,606 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-09-26 21:53:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:42,797 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-09-26 21:53:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:42,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-09-26 21:53:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:42,800 INFO L225 Difference]: With dead ends: 205 [2018-09-26 21:53:42,800 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 21:53:42,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 21:53:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 21:53:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 21:53:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-09-26 21:53:42,819 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-09-26 21:53:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:42,821 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-09-26 21:53:42,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-09-26 21:53:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 21:53:42,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:42,825 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:42,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:42,826 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-09-26 21:53:42,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-26 21:53:42,937 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:42,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:42,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:42,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:42,939 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-09-26 21:53:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:43,282 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-09-26 21:53:43,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:43,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-26 21:53:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:43,286 INFO L225 Difference]: With dead ends: 240 [2018-09-26 21:53:43,286 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 21:53:43,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 21:53:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 21:53:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 21:53:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-09-26 21:53:43,306 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-09-26 21:53:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:43,307 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-09-26 21:53:43,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-09-26 21:53:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 21:53:43,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:43,309 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:43,309 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:43,310 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-09-26 21:53:43,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-09-26 21:53:43,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:43,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:43,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:43,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:43,396 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-09-26 21:53:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:43,830 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-09-26 21:53:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:43,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-09-26 21:53:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:43,832 INFO L225 Difference]: With dead ends: 297 [2018-09-26 21:53:43,832 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 21:53:43,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 21:53:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 21:53:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 21:53:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-09-26 21:53:43,853 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-09-26 21:53:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:43,854 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-09-26 21:53:43,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-09-26 21:53:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 21:53:43,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:43,856 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:43,857 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:43,857 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-09-26 21:53:43,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:43,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-26 21:53:43,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:43,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:43,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:43,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:43,981 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:43,981 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-09-26 21:53:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:44,185 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-09-26 21:53:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:44,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-26 21:53:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:44,188 INFO L225 Difference]: With dead ends: 360 [2018-09-26 21:53:44,188 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 21:53:44,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 21:53:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 21:53:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 21:53:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-09-26 21:53:44,210 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-09-26 21:53:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:44,211 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-09-26 21:53:44,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-09-26 21:53:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 21:53:44,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:44,214 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:44,214 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:44,214 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-09-26 21:53:44,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:44,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:44,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:44,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:44,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:44,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:44,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:44,345 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-09-26 21:53:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:45,004 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-09-26 21:53:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:45,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-09-26 21:53:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:45,007 INFO L225 Difference]: With dead ends: 429 [2018-09-26 21:53:45,007 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 21:53:45,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 21:53:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 21:53:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 21:53:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-09-26 21:53:45,024 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-09-26 21:53:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:45,025 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-09-26 21:53:45,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-09-26 21:53:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 21:53:45,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:45,027 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:45,027 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:45,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-09-26 21:53:45,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:45,274 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:45,280 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-26 21:53:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:45,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-09-26 21:53:46,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:46,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:53:46,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:46,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:46,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:46,213 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-09-26 21:53:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:47,764 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-09-26 21:53:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:53:47,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-09-26 21:53:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:47,765 INFO L225 Difference]: With dead ends: 530 [2018-09-26 21:53:47,765 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:47,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:47,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-09-26 21:53:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:47,767 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:47,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:47,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:47,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:48,484 WARN L178 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-26 21:53:49,081 WARN L178 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-26 21:53:49,352 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-26 21:53:49,518 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-09-26 21:53:49,695 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-26 21:53:50,173 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-26 21:53:50,442 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-26 21:53:50,518 INFO L422 ceAbstractionStarter]: At program point L440(lines 440 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,518 INFO L422 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,518 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4) (= ULTIMATE.start_ssl3_connect_~s__state~3 4432)) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 307) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L420(lines 420 437) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,519 INFO L422 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,520 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-09-26 21:53:50,520 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-09-26 21:53:50,520 INFO L422 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,520 INFO L422 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,520 INFO L422 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,520 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-09-26 21:53:50,521 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-09-26 21:53:50,521 INFO L422 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,521 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-09-26 21:53:50,521 INFO L422 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-09-26 21:53:50,521 INFO L422 ceAbstractionStarter]: At program point L311(lines 306 330) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-09-26 21:53:50,537 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:53:50 BoogieIcfgContainer [2018-09-26 21:53:50,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:50,538 INFO L168 Benchmark]: Toolchain (without parser) took 12144.67 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 121.4 MB). Peak memory consumption was 150.8 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:50,540 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:50,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:50,541 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:50,542 INFO L168 Benchmark]: RCFGBuilder took 652.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:50,543 INFO L168 Benchmark]: TraceAbstraction took 11381.04 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 89.7 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:50,549 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 652.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11381.04 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 29.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 89.7 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4432 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 11.2s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=12, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 71345 SizeOfPredicates, 2 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2279/2289 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_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-50-566.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-50-566.csv Received shutdown request...