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_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:05,463 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:05,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:05,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:05,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:05,479 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:05,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:05,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:05,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:05,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:05,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:05,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:05,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:05,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:05,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:05,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:05,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:05,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:05,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:05,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:05,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:05,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:05,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:05,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:05,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:05,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:05,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:05,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:05,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:05,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:05,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:05,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:05,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:05,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:05,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:05,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:05,524 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:05,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:05,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:05,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:05,540 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:05,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:05,541 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:05,541 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:05,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:05,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:05,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:05,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:05,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:05,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:05,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:05,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:05,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:05,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:05,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:05,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:05,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:05,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:05,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:05,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:05,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:05,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:05,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:05,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:05,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:05,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:05,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:05,545 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:05,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:05,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:05,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:05,606 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:05,607 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:05,608 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-04 12:53:05,608 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-04 12:53:05,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:05,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:05,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:05,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:05,688 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:05,707 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,723 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:05,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:05,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:05,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:05,742 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,742 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,746 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,746 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,764 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,770 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,776 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 04.10 12:53:05" (1/1) ... [2018-10-04 12:53:05,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:05,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:05,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:05,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:05,787 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 04.10 12:53:05" (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:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:05,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:06,614 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:06,615 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:06 BoogieIcfgContainer [2018-10-04 12:53:06,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:06,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:06,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:06,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:06,620 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 04.10 12:53:05" (1/2) ... [2018-10-04 12:53:06,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9ea9a and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:06, skipping insertion in model container [2018-10-04 12:53:06,621 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 04.10 12:53:06" (2/2) ... [2018-10-04 12:53:06,623 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-10-04 12:53:06,632 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:06,642 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:06,700 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:06,701 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:06,701 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:06,701 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:06,701 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:06,702 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:06,702 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:06,702 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:06,702 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-04 12:53:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:53:06,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,746 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-10-04 12:53:06,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,990 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:06,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:06,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,016 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-04 12:53:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,204 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2018-10-04 12:53:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:53:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,219 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:53:07,219 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:53:07,222 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:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:53:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:53:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:53:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-10-04 12:53:07,260 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-10-04 12:53:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,261 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-10-04 12:53:07,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-10-04 12:53:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:53:07,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,262 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,262 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-10-04 12:53:07,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,343 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:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,346 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-10-04 12:53:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,529 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-10-04 12:53:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 12:53:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,531 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:53:07,531 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:53:07,532 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:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:53:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:53:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:53:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-10-04 12:53:07,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2018-10-04 12:53:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-10-04 12:53:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-04 12:53:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:53:07,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,540 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,541 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,541 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-10-04 12:53:07,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,668 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:07,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,670 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2018-10-04 12:53:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,802 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2018-10-04 12:53:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:53:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,804 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:53:07,805 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:53:07,805 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:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:53:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:53:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:53:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-04 12:53:07,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2018-10-04 12:53:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,815 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-04 12:53:07,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 12:53:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:53:07,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,817 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,817 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-10-04 12:53:07,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,950 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:07,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,952 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-04 12:53:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,078 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-10-04 12:53:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 12:53:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,081 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:53:08,082 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:53:08,082 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:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:53:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:53:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:53:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-10-04 12:53:08,089 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2018-10-04 12:53:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,090 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-10-04 12:53:08,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-10-04 12:53:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:53:08,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,092 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,092 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2123032451, now seen corresponding path program 1 times [2018-10-04 12:53:08,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,164 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:08,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,167 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2018-10-04 12:53:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,463 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2018-10-04 12:53:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:53:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,465 INFO L225 Difference]: With dead ends: 78 [2018-10-04 12:53:08,465 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:53:08,466 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:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:53:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:53:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:53:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-10-04 12:53:08,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 30 [2018-10-04 12:53:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,474 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-10-04 12:53:08,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-10-04 12:53:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:53:08,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,475 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-04 12:53:08,476 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,476 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash -919972413, now seen corresponding path program 1 times [2018-10-04 12:53:08,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,575 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-04 12:53:08,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,577 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-10-04 12:53:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,657 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-10-04 12:53:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-04 12:53:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,661 INFO L225 Difference]: With dead ends: 94 [2018-10-04 12:53:08,661 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:53:08,661 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:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:53:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:53:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:53:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-10-04 12:53:08,674 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 39 [2018-10-04 12:53:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,674 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-10-04 12:53:08,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-10-04 12:53:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:53:08,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,676 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-04 12:53:08,676 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,676 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1178137851, now seen corresponding path program 1 times [2018-10-04 12:53:08,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,804 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:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,806 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-10-04 12:53:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,025 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-10-04 12:53:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-04 12:53:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,029 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:53:09,030 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:53:09,030 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:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:53:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-10-04 12:53:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:53:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-10-04 12:53:09,041 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 39 [2018-10-04 12:53:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,041 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-10-04 12:53:09,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-10-04 12:53:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:53:09,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,043 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-04 12:53:09,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,044 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash -497270587, now seen corresponding path program 1 times [2018-10-04 12:53:09,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,099 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-04 12:53:09,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,101 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 3 states. [2018-10-04 12:53:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,153 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2018-10-04 12:53:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-04 12:53:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,155 INFO L225 Difference]: With dead ends: 134 [2018-10-04 12:53:09,155 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:53:09,156 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:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:53:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 12:53:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:53:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-10-04 12:53:09,168 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 39 [2018-10-04 12:53:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,168 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-10-04 12:53:09,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2018-10-04 12:53:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:53:09,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,170 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-04 12:53:09,171 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,171 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1610522479, now seen corresponding path program 1 times [2018-10-04 12:53:09,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,239 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-04 12:53:09,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,241 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 3 states. [2018-10-04 12:53:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,679 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2018-10-04 12:53:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-04 12:53:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,682 INFO L225 Difference]: With dead ends: 159 [2018-10-04 12:53:09,682 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:53:09,683 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:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:53:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-04 12:53:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:53:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2018-10-04 12:53:09,695 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 56 [2018-10-04 12:53:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,696 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2018-10-04 12:53:09,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2018-10-04 12:53:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:53:09,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,698 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-04 12:53:09,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,698 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,699 INFO L82 PathProgramCache]: Analyzing trace with hash -919794, now seen corresponding path program 1 times [2018-10-04 12:53:09,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,811 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-04 12:53:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,813 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 3 states. [2018-10-04 12:53:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,915 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2018-10-04 12:53:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 12:53:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,917 INFO L225 Difference]: With dead ends: 199 [2018-10-04 12:53:09,917 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:53:09,917 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:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:53:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 12:53:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:53:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-10-04 12:53:09,932 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 68 [2018-10-04 12:53:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,932 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-10-04 12:53:09,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-10-04 12:53:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:53:09,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,934 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-04 12:53:09,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,935 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1962879724, now seen corresponding path program 1 times [2018-10-04 12:53:09,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,052 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-04 12:53:10,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:10,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:10,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:10,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:10,056 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 3 states. [2018-10-04 12:53:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:10,323 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2018-10-04 12:53:10,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:10,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-04 12:53:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:10,325 INFO L225 Difference]: With dead ends: 233 [2018-10-04 12:53:10,325 INFO L226 Difference]: Without dead ends: 127 [2018-10-04 12:53:10,326 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:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-04 12:53:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-04 12:53:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 12:53:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2018-10-04 12:53:10,343 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 77 [2018-10-04 12:53:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:10,343 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2018-10-04 12:53:10,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2018-10-04 12:53:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:53:10,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:10,345 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-04 12:53:10,345 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:10,346 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1866233676, now seen corresponding path program 1 times [2018-10-04 12:53:10,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:10,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,442 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-04 12:53:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:10,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:10,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:10,444 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand 3 states. [2018-10-04 12:53:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:10,660 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2018-10-04 12:53:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:10,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-04 12:53:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:10,664 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:53:10,664 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:53:10,665 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:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:53:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-04 12:53:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 12:53:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-10-04 12:53:10,680 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 86 [2018-10-04 12:53:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:10,681 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-10-04 12:53:10,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-10-04 12:53:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:53:10,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:10,683 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-04 12:53:10,683 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:10,683 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash -82543983, now seen corresponding path program 1 times [2018-10-04 12:53:10,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,787 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-04 12:53:10,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:10,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:10,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:10,788 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 3 states. [2018-10-04 12:53:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:10,906 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2018-10-04 12:53:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:10,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-04 12:53:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:10,909 INFO L225 Difference]: With dead ends: 313 [2018-10-04 12:53:10,910 INFO L226 Difference]: Without dead ends: 169 [2018-10-04 12:53:10,910 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:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-04 12:53:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-10-04 12:53:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-04 12:53:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2018-10-04 12:53:10,925 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 96 [2018-10-04 12:53:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:10,926 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2018-10-04 12:53:10,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-10-04 12:53:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 12:53:10,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:10,928 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-04 12:53:10,928 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:10,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash -666240887, now seen corresponding path program 1 times [2018-10-04 12:53:10,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:11,052 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-04 12:53:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:11,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:11,054 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 3 states. [2018-10-04 12:53:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:11,517 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2018-10-04 12:53:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:11,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 12:53:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:11,519 INFO L225 Difference]: With dead ends: 359 [2018-10-04 12:53:11,519 INFO L226 Difference]: Without dead ends: 193 [2018-10-04 12:53:11,520 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:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-04 12:53:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-10-04 12:53:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-04 12:53:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-10-04 12:53:11,535 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 107 [2018-10-04 12:53:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:11,536 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-10-04 12:53:11,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-10-04 12:53:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-04 12:53:11,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:11,538 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-04 12:53:11,538 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:11,539 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 133203942, now seen corresponding path program 1 times [2018-10-04 12:53:11,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:11,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:11,776 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-04 12:53:11,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:11,777 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:11,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:12,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:12,172 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-04 12:53:12,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:12,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:12,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:12,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:12,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:12,204 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 4 states. [2018-10-04 12:53:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:12,794 INFO L93 Difference]: Finished difference Result 371 states and 424 transitions. [2018-10-04 12:53:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:12,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-10-04 12:53:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:12,795 INFO L225 Difference]: With dead ends: 371 [2018-10-04 12:53:12,795 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:12,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 3 [2018-10-04 12:53:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:12,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-10-04 12:53:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:12,797 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:12,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:12,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:12,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:13,504 WARN L178 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 12:53:13,646 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-04 12:53:14,031 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 12:53:14,230 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 12:53:14,397 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:53:15,028 WARN L178 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-04 12:53:15,351 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:53:15,663 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 12:53:15,803 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= 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-04 12:53:15,804 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-04 12:53:15,804 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-04 12:53:15,804 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (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-04 12:53:15,804 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= 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-04 12:53:15,804 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-04 12:53:15,804 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= 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-04 12:53:15,804 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-10-04 12:53:15,804 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-10-04 12:53:15,805 INFO L421 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-10-04 12:53:15,805 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-04 12:53:15,805 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-04 12:53:15,805 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-04 12:53:15,805 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) no Hoare annotation was computed. [2018-10-04 12:53:15,805 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-04 12:53:15,805 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-10-04 12:53:15,805 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-04 12:53:15,805 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-04 12:53:15,806 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-04 12:53:15,806 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (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-04 12:53:15,806 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-04 12:53:15,806 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_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= 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-04 12:53:15,820 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:15 BoogieIcfgContainer [2018-10-04 12:53:15,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:15,821 INFO L168 Benchmark]: Toolchain (without parser) took 10135.43 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.5 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 29.6 MB). Peak memory consumption was 490.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,822 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:15,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.05 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:15,824 INFO L168 Benchmark]: Boogie Preprocessor took 54.76 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:15,825 INFO L168 Benchmark]: RCFGBuilder took 829.38 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,826 INFO L168 Benchmark]: TraceAbstraction took 9203.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -12.7 MB). Peak memory consumption was 448.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,831 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.05 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 54.76 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 829.38 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9203.96 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 43.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -12.7 MB). Peak memory consumption was 448.1 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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || 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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || 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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || 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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((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_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || 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, 9.1s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 60 SDslu, 167 SDs, 0 SdLazy, 428 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s 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, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-15-848.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-15-848.csv Received shutdown request...