java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:00,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:00,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:00,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:00,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:00,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:00,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:00,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:00,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:00,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:00,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:00,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:00,109 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:00,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:00,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:00,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:00,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:00,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:00,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:00,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:00,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:00,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:00,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:00,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:00,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:00,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:00,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:00,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:00,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:00,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:00,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:00,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:00,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:00,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:00,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:00,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:00,136 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:53:00,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:00,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:00,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:00,164 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:00,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:00,165 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:00,165 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:00,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:00,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:00,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:00,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:00,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:00,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:00,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:00,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:00,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:00,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:00,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:00,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:00,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:00,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:00,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:00,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:00,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:00,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:00,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:00,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:00,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:00,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:00,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:00,173 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:00,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:00,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:00,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:00,261 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:00,261 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:00,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-10-04 12:53:00,262 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-10-04 12:53:00,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:00,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:00,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:00,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:00,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:00,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:00,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:00,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:00,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:00,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/1) ... [2018-10-04 12:53:00,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:00,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:00,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:00,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:00,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (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-04 12:53:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:00,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:01,268 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:01,269 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:01 BoogieIcfgContainer [2018-10-04 12:53:01,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:01,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:01,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:01,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:00" (1/2) ... [2018-10-04 12:53:01,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130cb68 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:01, skipping insertion in model container [2018-10-04 12:53:01,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:01" (2/2) ... [2018-10-04 12:53:01,277 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-10-04 12:53:01,286 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:01,294 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:01,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:01,341 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:01,341 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:01,341 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:01,342 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:01,342 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:01,342 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:01,342 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:01,342 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-04 12:53:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:53:01,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:01,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:01,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:01,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-10-04 12:53:01,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:01,574 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-04 12:53:01,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:01,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:01,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:01,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:01,594 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-04 12:53:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:01,777 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2018-10-04 12:53:01,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:53:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:01,793 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:53:01,794 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:53:01,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:53:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:53:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:53:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-10-04 12:53:01,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 10 [2018-10-04 12:53:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:01,836 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-10-04 12:53:01,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-10-04 12:53:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:53:01,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:01,837 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:01,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:01,838 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-10-04 12:53:01,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:01,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:01,997 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-04 12:53:01,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:01,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,000 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-10-04 12:53:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,199 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2018-10-04 12:53:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 12:53:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,201 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:53:02,202 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:53:02,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:53:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:53:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:53:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-10-04 12:53:02,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 13 [2018-10-04 12:53:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,211 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-10-04 12:53:02,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-10-04 12:53:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:53:02,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,213 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-10-04 12:53:02,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,360 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-04 12:53:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,362 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-10-04 12:53:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,451 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2018-10-04 12:53:02,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:53:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,454 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:53:02,454 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:53:02,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:53:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:53:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:53:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-04 12:53:02,462 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-10-04 12:53:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,463 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-04 12:53:02,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 12:53:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:53:02,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,464 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-10-04 12:53:02,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,597 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-04 12:53:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,599 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,599 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-04 12:53:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:02,789 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2018-10-04 12:53:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:02,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 12:53:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:02,791 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:53:02,791 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:53:02,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:53:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:53:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:53:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-10-04 12:53:02,799 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2018-10-04 12:53:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:02,800 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-10-04 12:53:02,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-10-04 12:53:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:53:02,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:02,801 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:02,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:02,802 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-10-04 12:53:02,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:02,914 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-04 12:53:02,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:02,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:02,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:02,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:02,916 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-10-04 12:53:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,132 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-10-04 12:53:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 12:53:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,134 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:53:03,134 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:53:03,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:53:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 12:53:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:53:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-10-04 12:53:03,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 28 [2018-10-04 12:53:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,142 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-10-04 12:53:03,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-10-04 12:53:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:53:03,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,144 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,144 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-10-04 12:53:03,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,222 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-04 12:53:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,224 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2018-10-04 12:53:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,400 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-10-04 12:53:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-04 12:53:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,406 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:53:03,406 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:53:03,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:53:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-10-04 12:53:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:53:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-10-04 12:53:03,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 35 [2018-10-04 12:53:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,422 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-10-04 12:53:03,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-10-04 12:53:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:53:03,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,424 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,425 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-10-04 12:53:03,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:53:03,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,546 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,546 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 3 states. [2018-10-04 12:53:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,692 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2018-10-04 12:53:03,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:53:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:03,696 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:53:03,696 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:53:03,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:53:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 12:53:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:53:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-10-04 12:53:03,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 44 [2018-10-04 12:53:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:03,716 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-10-04 12:53:03,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-10-04 12:53:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:53:03,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:03,718 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:03,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:03,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-10-04 12:53:03,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:03,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-04 12:53:03,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:03,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:03,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:03,801 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:03,801 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 3 states. [2018-10-04 12:53:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:03,999 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-10-04 12:53:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-04 12:53:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:04,001 INFO L225 Difference]: With dead ends: 143 [2018-10-04 12:53:04,001 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:53:04,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:53:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 12:53:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:53:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-04 12:53:04,017 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 53 [2018-10-04 12:53:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:04,017 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-04 12:53:04,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-04 12:53:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:53:04,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,020 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,020 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,020 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 138737266, now seen corresponding path program 1 times [2018-10-04 12:53:04,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-04 12:53:04,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:04,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,138 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-04 12:53:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:04,424 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2018-10-04 12:53:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:04,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 12:53:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:04,427 INFO L225 Difference]: With dead ends: 177 [2018-10-04 12:53:04,427 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 12:53:04,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 12:53:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 12:53:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 12:53:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-10-04 12:53:04,441 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 65 [2018-10-04 12:53:04,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:04,441 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-10-04 12:53:04,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-10-04 12:53:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:53:04,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,443 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,444 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,444 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1273491131, now seen corresponding path program 1 times [2018-10-04 12:53:04,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-04 12:53:04,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:04,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,556 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,556 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 3 states. [2018-10-04 12:53:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:04,894 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-10-04 12:53:04,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:04,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-10-04 12:53:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:04,896 INFO L225 Difference]: With dead ends: 209 [2018-10-04 12:53:04,896 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 12:53:04,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 12:53:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-04 12:53:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 12:53:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-10-04 12:53:04,927 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 75 [2018-10-04 12:53:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:04,928 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-10-04 12:53:04,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-10-04 12:53:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:53:04,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,930 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,931 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,931 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 739368033, now seen corresponding path program 1 times [2018-10-04 12:53:04,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:05,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,052 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 3 states. [2018-10-04 12:53:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,220 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-10-04 12:53:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-04 12:53:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,223 INFO L225 Difference]: With dead ends: 255 [2018-10-04 12:53:05,223 INFO L226 Difference]: Without dead ends: 141 [2018-10-04 12:53:05,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-04 12:53:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-04 12:53:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 12:53:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-10-04 12:53:05,240 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 86 [2018-10-04 12:53:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,240 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-10-04 12:53:05,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-10-04 12:53:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:53:05,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,243 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,243 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,243 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1128890468, now seen corresponding path program 1 times [2018-10-04 12:53:05,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:05,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:05,462 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-04 12:53:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:06,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:06,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:06,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:06,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,484 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 4 states. [2018-10-04 12:53:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,133 INFO L93 Difference]: Finished difference Result 387 states and 465 transitions. [2018-10-04 12:53:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:07,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-04 12:53:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,135 INFO L225 Difference]: With dead ends: 387 [2018-10-04 12:53:07,135 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:07,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.0s impTime 3 [2018-10-04 12:53:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:07,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-10-04 12:53:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,138 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:07,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:07,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:07,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:07,583 WARN L178 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-04 12:53:07,716 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-04 12:53:08,210 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-04 12:53:08,529 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-04 12:53:08,532 INFO L421 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,532 INFO L421 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,532 INFO L421 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,533 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 486) no Hoare annotation was computed. [2018-10-04 12:53:08,533 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,533 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-10-04 12:53:08,533 INFO L421 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-10-04 12:53:08,533 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,534 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,534 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-10-04 12:53:08,534 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) no Hoare annotation was computed. [2018-10-04 12:53:08,534 INFO L421 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,534 INFO L421 ceAbstractionStarter]: At program point L459(lines 459 476) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,535 INFO L421 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,535 INFO L421 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,535 INFO L421 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-10-04 12:53:08,535 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 456) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,535 INFO L421 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-04 12:53:08,548 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:08 BoogieIcfgContainer [2018-10-04 12:53:08,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:08,549 INFO L168 Benchmark]: Toolchain (without parser) took 8201.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 415.0 MB). Peak memory consumption was 415.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:08,551 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:08,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:08,552 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 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-04 12:53:08,553 INFO L168 Benchmark]: RCFGBuilder took 819.81 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-04 12:53:08,556 INFO L168 Benchmark]: TraceAbstraction took 7278.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:08,561 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.97 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 819.81 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 7278.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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: 417]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 439]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 353]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 459]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 383]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 371]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 317]: 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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((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)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: 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)) || 4480 <= ssl3_connect_~s__state~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 36 SDslu, 67 SDs, 0 SdLazy, 361 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=11, 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, 12 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 262 NumberOfFragments, 188 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1789 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 58057 SizeOfPredicates, 2 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1854/1870 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_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-08-596.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-08-596.csv Received shutdown request...