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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:49:01,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:49:01,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:49:02,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:49:02,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:49:02,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:49:02,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:49:02,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:49:02,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:49:02,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:49:02,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:49:02,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:49:02,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:49:02,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:49:02,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:49:02,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:49:02,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:49:02,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:49:02,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:49:02,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:49:02,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:49:02,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:49:02,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:49:02,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:49:02,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:49:02,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:49:02,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:49:02,045 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:49:02,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:49:02,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:49:02,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:49:02,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:49:02,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:49:02,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:49:02,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:49:02,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:49:02,054 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:49:02,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:49:02,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:49:02,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:49:02,078 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:49:02,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:49:02,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:49:02,079 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:49:02,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:49:02,080 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:49:02,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:49:02,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:49:02,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:49:02,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:49:02,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:49:02,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:49:02,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:49:02,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:49:02,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:49:02,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:49:02,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:49:02,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:49:02,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:49:02,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:02,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:49:02,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:49:02,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:49:02,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:49:02,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:49:02,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:49:02,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:49:02,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:49:02,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:49:02,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:49:02,173 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:49:02,174 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:49:02,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-10-02 11:49:02,175 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-10-02 11:49:02,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:49:02,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:49:02,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:02,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:49:02,282 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:49:02,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:02,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:49:02,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:49:02,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:49:02,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... [2018-10-02 11:49:02,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:49:02,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:49:02,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:49:02,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:49:02,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:49:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:49:03,184 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:49:03,185 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:03 BoogieIcfgContainer [2018-10-02 11:49:03,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:49:03,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:49:03,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:49:03,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:49:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:02" (1/2) ... [2018-10-02 11:49:03,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576bbaed and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:03, skipping insertion in model container [2018-10-02 11:49:03,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:03" (2/2) ... [2018-10-02 11:49:03,193 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-10-02 11:49:03,203 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:49:03,212 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:49:03,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:49:03,260 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:49:03,260 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:49:03,261 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:49:03,261 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:49:03,261 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:49:03,261 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:49:03,261 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:49:03,261 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:49:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-02 11:49:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:49:03,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:03,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:03,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:03,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-10-02 11:49:03,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:03,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:03,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:03,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:03,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:03,512 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-02 11:49:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:03,737 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2018-10-02 11:49:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:03,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-02 11:49:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:03,751 INFO L225 Difference]: With dead ends: 41 [2018-10-02 11:49:03,751 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 11:49:03,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 11:49:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 11:49:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 11:49:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-10-02 11:49:03,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-10-02 11:49:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:03,800 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-10-02 11:49:03,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-10-02 11:49:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:49:03,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:03,801 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:03,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:03,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-10-02 11:49:03,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:03,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:49:03,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:03,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:03,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:03,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:03,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:03,914 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-10-02 11:49:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:04,284 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-10-02 11:49:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:04,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-02 11:49:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:04,286 INFO L225 Difference]: With dead ends: 45 [2018-10-02 11:49:04,286 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 11:49:04,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 11:49:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 11:49:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 11:49:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-10-02 11:49:04,295 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2018-10-02 11:49:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-10-02 11:49:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-02 11:49:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:49:04,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:04,297 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:04,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:04,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-10-02 11:49:04,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:49:04,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:04,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:04,448 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2018-10-02 11:49:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:04,662 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2018-10-02 11:49:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:04,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:49:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:04,664 INFO L225 Difference]: With dead ends: 54 [2018-10-02 11:49:04,664 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 11:49:04,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 11:49:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 11:49:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 11:49:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-02 11:49:04,672 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2018-10-02 11:49:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:04,672 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-02 11:49:04,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-02 11:49:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:49:04,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:04,674 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:04,674 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:04,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-10-02 11:49:04,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 11:49:04,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:04,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:04,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:04,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:04,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:04,792 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-02 11:49:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:04,927 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-10-02 11:49:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:04,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 11:49:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:04,929 INFO L225 Difference]: With dead ends: 65 [2018-10-02 11:49:04,929 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:49:04,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:49:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 11:49:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:49:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-10-02 11:49:04,938 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2018-10-02 11:49:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:04,938 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-10-02 11:49:04,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-10-02 11:49:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:49:04,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:04,940 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:04,940 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:04,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2123032451, now seen corresponding path program 1 times [2018-10-02 11:49:04,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:04,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:49:05,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:05,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:05,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,095 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2018-10-02 11:49:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:05,322 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2018-10-02 11:49:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:05,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:49:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:05,324 INFO L225 Difference]: With dead ends: 78 [2018-10-02 11:49:05,324 INFO L226 Difference]: Without dead ends: 44 [2018-10-02 11:49:05,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-02 11:49:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-02 11:49:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-02 11:49:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-10-02 11:49:05,334 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 30 [2018-10-02 11:49:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:05,334 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-10-02 11:49:05,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-10-02 11:49:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 11:49:05,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:05,336 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:05,336 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:05,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -919972413, now seen corresponding path program 1 times [2018-10-02 11:49:05,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:05,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:05,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:05,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:49:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:05,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,434 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-10-02 11:49:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:05,513 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-10-02 11:49:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:05,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-02 11:49:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:05,515 INFO L225 Difference]: With dead ends: 94 [2018-10-02 11:49:05,515 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 11:49:05,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 11:49:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-02 11:49:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:49:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-10-02 11:49:05,526 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 39 [2018-10-02 11:49:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:05,527 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-10-02 11:49:05,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-10-02 11:49:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 11:49:05,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:05,529 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:05,529 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:05,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1178137851, now seen corresponding path program 1 times [2018-10-02 11:49:05,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:05,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:49:05,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:05,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:05,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,628 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-10-02 11:49:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:05,760 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-10-02 11:49:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:05,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-02 11:49:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:05,763 INFO L225 Difference]: With dead ends: 75 [2018-10-02 11:49:05,764 INFO L226 Difference]: Without dead ends: 73 [2018-10-02 11:49:05,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-02 11:49:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-10-02 11:49:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-02 11:49:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-10-02 11:49:05,776 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 39 [2018-10-02 11:49:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:05,776 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-10-02 11:49:05,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-10-02 11:49:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 11:49:05,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:05,778 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:05,779 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:05,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -497270587, now seen corresponding path program 1 times [2018-10-02 11:49:05,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-02 11:49:05,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:05,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:05,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,869 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 3 states. [2018-10-02 11:49:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:05,996 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2018-10-02 11:49:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:05,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-02 11:49:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:05,998 INFO L225 Difference]: With dead ends: 134 [2018-10-02 11:49:05,998 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 11:49:05,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 11:49:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-02 11:49:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-02 11:49:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-10-02 11:49:06,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 39 [2018-10-02 11:49:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:06,009 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-10-02 11:49:06,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2018-10-02 11:49:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-02 11:49:06,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:06,012 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:06,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:06,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1610522479, now seen corresponding path program 1 times [2018-10-02 11:49:06,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:06,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-02 11:49:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:06,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:06,109 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 3 states. [2018-10-02 11:49:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:06,558 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2018-10-02 11:49:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:06,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-02 11:49:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:06,561 INFO L225 Difference]: With dead ends: 159 [2018-10-02 11:49:06,562 INFO L226 Difference]: Without dead ends: 93 [2018-10-02 11:49:06,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-02 11:49:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-02 11:49:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-02 11:49:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2018-10-02 11:49:06,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 56 [2018-10-02 11:49:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:06,576 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2018-10-02 11:49:06,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2018-10-02 11:49:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:49:06,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:06,578 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:06,579 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:06,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash -919794, now seen corresponding path program 1 times [2018-10-02 11:49:06,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-02 11:49:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:06,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:06,697 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 3 states. [2018-10-02 11:49:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:06,975 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2018-10-02 11:49:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:06,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-02 11:49:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:06,977 INFO L225 Difference]: With dead ends: 199 [2018-10-02 11:49:06,977 INFO L226 Difference]: Without dead ends: 109 [2018-10-02 11:49:06,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-02 11:49:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-02 11:49:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-02 11:49:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-10-02 11:49:06,993 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 68 [2018-10-02 11:49:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:06,993 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-10-02 11:49:06,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-10-02 11:49:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 11:49:06,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:06,996 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 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] [2018-10-02 11:49:06,996 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:06,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1962879724, now seen corresponding path program 1 times [2018-10-02 11:49:06,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-02 11:49:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:07,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:07,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:07,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:07,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:07,080 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 3 states. [2018-10-02 11:49:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:07,165 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2018-10-02 11:49:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:07,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-02 11:49:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:07,171 INFO L225 Difference]: With dead ends: 233 [2018-10-02 11:49:07,171 INFO L226 Difference]: Without dead ends: 127 [2018-10-02 11:49:07,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-02 11:49:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-02 11:49:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-02 11:49:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2018-10-02 11:49:07,207 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 77 [2018-10-02 11:49:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:07,208 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2018-10-02 11:49:07,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2018-10-02 11:49:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 11:49:07,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:07,210 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:07,213 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:07,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1866233676, now seen corresponding path program 1 times [2018-10-02 11:49:07,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:07,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-02 11:49:07,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:07,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:07,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:07,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:07,340 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand 3 states. [2018-10-02 11:49:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:07,792 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2018-10-02 11:49:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:07,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-02 11:49:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:07,795 INFO L225 Difference]: With dead ends: 271 [2018-10-02 11:49:07,795 INFO L226 Difference]: Without dead ends: 147 [2018-10-02 11:49:07,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-02 11:49:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-02 11:49:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 11:49:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-10-02 11:49:07,809 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 86 [2018-10-02 11:49:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:07,810 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-10-02 11:49:07,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-10-02 11:49:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 11:49:07,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:07,812 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:07,812 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:07,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash -82543983, now seen corresponding path program 1 times [2018-10-02 11:49:07,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-02 11:49:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:07,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:07,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:07,929 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 3 states. [2018-10-02 11:49:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:08,398 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2018-10-02 11:49:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:08,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-02 11:49:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:08,401 INFO L225 Difference]: With dead ends: 313 [2018-10-02 11:49:08,402 INFO L226 Difference]: Without dead ends: 169 [2018-10-02 11:49:08,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-02 11:49:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-10-02 11:49:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-02 11:49:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2018-10-02 11:49:08,416 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 96 [2018-10-02 11:49:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:08,417 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2018-10-02 11:49:08,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-10-02 11:49:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-02 11:49:08,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:08,419 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:08,419 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:08,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -666240887, now seen corresponding path program 1 times [2018-10-02 11:49:08,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:08,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:08,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:08,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-02 11:49:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:08,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:08,539 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 3 states. [2018-10-02 11:49:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:09,132 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2018-10-02 11:49:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:09,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-02 11:49:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:09,134 INFO L225 Difference]: With dead ends: 359 [2018-10-02 11:49:09,134 INFO L226 Difference]: Without dead ends: 193 [2018-10-02 11:49:09,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-02 11:49:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-10-02 11:49:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-02 11:49:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-10-02 11:49:09,150 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 107 [2018-10-02 11:49:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:09,150 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-10-02 11:49:09,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-10-02 11:49:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-02 11:49:09,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:09,152 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:09,152 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:09,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash 133203942, now seen corresponding path program 1 times [2018-10-02 11:49:09,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:09,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-02 11:49:09,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:09,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:09,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-02 11:49:09,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:49:09,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:49:09,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:09,578 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 4 states. [2018-10-02 11:49:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:10,154 INFO L93 Difference]: Finished difference Result 371 states and 424 transitions. [2018-10-02 11:49:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:49:10,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-10-02 11:49:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:10,155 INFO L225 Difference]: With dead ends: 371 [2018-10-02 11:49:10,155 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:10,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:10,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-10-02 11:49:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:10,158 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:10,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:10,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:10,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:10,825 WARN L178 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-02 11:49:10,989 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-02 11:49:11,138 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-02 11:49:11,444 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-02 11:49:11,848 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-02 11:49:12,052 INFO L421 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,052 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,052 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 386) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-10-02 11:49:12,052 INFO L421 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,053 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) no Hoare annotation was computed. [2018-10-02 11:49:12,053 INFO L421 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,053 INFO L421 ceAbstractionStarter]: At program point L362(lines 357 375) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4400) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-10-02 11:49:12,053 INFO L421 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,053 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:12,053 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:12,053 INFO L421 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-10-02 11:49:12,054 INFO L421 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,054 INFO L421 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,054 INFO L421 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-10-02 11:49:12,054 INFO L421 ceAbstractionStarter]: At program point L388(lines 385 401) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-02 11:49:12,054 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:12,054 INFO L421 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,055 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 358) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-10-02 11:49:12,055 INFO L421 ceAbstractionStarter]: At program point L480(lines 480 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,055 INFO L421 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,055 INFO L421 ceAbstractionStarter]: At program point L460(lines 460 477) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,055 INFO L421 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-10-02 11:49:12,071 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:12 BoogieIcfgContainer [2018-10-02 11:49:12,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:12,072 INFO L168 Benchmark]: Toolchain (without parser) took 9794.00 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 26.2 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:12,073 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:12,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:12,075 INFO L168 Benchmark]: Boogie Preprocessor took 62.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:12,075 INFO L168 Benchmark]: RCFGBuilder took 786.33 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-10-02 11:49:12,082 INFO L168 Benchmark]: TraceAbstraction took 8884.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -5.5 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:12,094 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.19 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 54.54 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 62.00 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 786.33 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 8884.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -5.5 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 385]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 60 SDslu, 167 SDs, 0 SdLazy, 428 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=14, 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, 15 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 198 NumberOfFragments, 390 HoareAnnotationTreeSize, 18 FomulaSimplifications, 1407 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 94303 SizeOfPredicates, 2 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2949/2961 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_4.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-49-12-115.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-49-12-115.csv Received shutdown request...