java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:03,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:03,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:03,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:03,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:03,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:03,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:03,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:03,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:03,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:03,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:03,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:03,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:03,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:03,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:03,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:03,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:03,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:03,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:03,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:03,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:03,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:03,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:03,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:03,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:03,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:03,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:03,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:03,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:03,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:03,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:03,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:03,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:03,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:03,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:03,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:03,487 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:03,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:03,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:03,503 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:03,503 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:03,503 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:03,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:03,504 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:03,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:03,504 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:03,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:03,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:03,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:03,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:03,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:03,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:03,507 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:03,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:03,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:03,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:03,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:03,508 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:03,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:03,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:03,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:03,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:03,509 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:03,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:03,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:03,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:03,597 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:03,597 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:03,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-04 12:53:03,599 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-10-04 12:53:03,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:03,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:03,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:03,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:03,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:03,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:03,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:03,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:03,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:03,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:03,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:03,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:03,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:03,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (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:03,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:04,536 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:04,537 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:04 BoogieIcfgContainer [2018-10-04 12:53:04,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:04,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:04,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:04,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:04,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/2) ... [2018-10-04 12:53:04,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104f4b8 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:04, skipping insertion in model container [2018-10-04 12:53:04,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:04" (2/2) ... [2018-10-04 12:53:04,545 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-04 12:53:04,555 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:04,566 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:04,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:04,614 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:04,614 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:04,614 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:04,615 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:04,615 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:04,615 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:04,615 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:04,615 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 12:53:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:53:04,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,640 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-10-04 12:53:04,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:04,854 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:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:04,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:04,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:04,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:04,877 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 12:53:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,064 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-10-04 12:53:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:53:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,080 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:53:05,080 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:53:05,084 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:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:53:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:53:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:53:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-10-04 12:53:05,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-10-04 12:53:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,128 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-10-04 12:53:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-10-04 12:53:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:53:05,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,130 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,131 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,131 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-10-04 12:53:05,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,225 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:05,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:05,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,228 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-10-04 12:53:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,416 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-10-04 12:53:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 12:53:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,418 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:53:05,418 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:53:05,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:53:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:53:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:53:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-10-04 12:53:05,426 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-10-04 12:53:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,426 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-10-04 12:53:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-10-04 12:53:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:53:05,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,428 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,430 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-10-04 12:53:05,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,547 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:05,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:05,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,550 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-10-04 12:53:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,690 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-10-04 12:53:05,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:53:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,691 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:53:05,692 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:53:05,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:53:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:53:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:53:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-10-04 12:53:05,699 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-10-04 12:53:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,699 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-10-04 12:53:05,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-10-04 12:53:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:53:05,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,701 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,702 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-10-04 12:53:05,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,841 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:05,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:05,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,843 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-10-04 12:53:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,986 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-10-04 12:53:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 12:53:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,988 INFO L225 Difference]: With dead ends: 74 [2018-10-04 12:53:05,988 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:53:05,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:53:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 12:53:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:53:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-10-04 12:53:05,998 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-10-04 12:53:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,999 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-10-04 12:53:05,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-10-04 12:53:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:53:06,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,001 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:06,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,001 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-10-04 12:53:06,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,126 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:06,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:06,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,128 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-10-04 12:53:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,244 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-10-04 12:53:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:53:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,246 INFO L225 Difference]: With dead ends: 92 [2018-10-04 12:53:06,246 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:53:06,247 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:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:53:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 12:53:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:53:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-10-04 12:53:06,259 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-10-04 12:53:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,260 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-10-04 12:53:06,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-10-04 12:53:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:53:06,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,262 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,262 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-10-04 12:53:06,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,372 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:06,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:06,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,374 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-10-04 12:53:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,490 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-10-04 12:53:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 12:53:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,496 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:53:06,496 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:53:06,496 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:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:53:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-10-04 12:53:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:53:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-10-04 12:53:06,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-10-04 12:53:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-10-04 12:53:06,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-10-04 12:53:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:53:06,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,510 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,511 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-10-04 12:53:06,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:53:06,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:06,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,582 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,582 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-10-04 12:53:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,788 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-10-04 12:53:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:53:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,795 INFO L225 Difference]: With dead ends: 161 [2018-10-04 12:53:06,795 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 12:53:06,796 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:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 12:53:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 12:53:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:53:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-10-04 12:53:06,811 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-10-04 12:53:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,812 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-10-04 12:53:06,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-10-04 12:53:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:53:06,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,814 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,815 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,815 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-10-04 12:53:06,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-04 12:53:06,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:06,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,895 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-10-04 12:53:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,254 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-10-04 12:53:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-04 12:53:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,256 INFO L225 Difference]: With dead ends: 205 [2018-10-04 12:53:07,257 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 12:53:07,261 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,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 12:53:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-10-04 12:53:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-04 12:53:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-10-04 12:53:07,280 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-10-04 12:53:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,280 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-10-04 12:53:07,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-10-04 12:53:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:53:07,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,283 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,283 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-10-04 12:53:07,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-04 12:53:07,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,398 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,398 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-10-04 12:53:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,806 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-10-04 12:53:07,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 12:53:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,810 INFO L225 Difference]: With dead ends: 240 [2018-10-04 12:53:07,811 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:53:07,812 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,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:53:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 12:53:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 12:53:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-10-04 12:53:07,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-10-04 12:53:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,830 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-10-04 12:53:07,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-10-04 12:53:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 12:53:07,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,832 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,832 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,833 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-10-04 12:53:07,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-04 12:53:07,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,974 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-10-04 12:53:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,466 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-10-04 12:53:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-04 12:53:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,470 INFO L225 Difference]: With dead ends: 297 [2018-10-04 12:53:08,470 INFO L226 Difference]: Without dead ends: 165 [2018-10-04 12:53:08,471 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,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-04 12:53:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-04 12:53:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 12:53:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-10-04 12:53:08,506 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-10-04 12:53:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,507 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-10-04 12:53:08,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-10-04 12:53:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:53:08,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,509 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,509 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,510 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-10-04 12:53:08,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-04 12:53:08,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,648 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-10-04 12:53:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,872 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-10-04 12:53:08,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-04 12:53:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,876 INFO L225 Difference]: With dead ends: 360 [2018-10-04 12:53:08,876 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:53:08,877 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,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:53:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-04 12:53:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-04 12:53:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-10-04 12:53:08,897 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-10-04 12:53:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-10-04 12:53:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-10-04 12:53:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 12:53:08,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,900 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,900 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,901 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-10-04 12:53:08,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:09,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,026 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-10-04 12:53:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,573 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-10-04 12:53:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-10-04 12:53:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,575 INFO L225 Difference]: With dead ends: 429 [2018-10-04 12:53:09,575 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 12:53:09,576 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,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 12:53:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-04 12:53:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-04 12:53:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-10-04 12:53:09,595 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-10-04 12:53:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,596 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-10-04 12:53:09,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-10-04 12:53:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 12:53:09,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,598 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:09,598 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-10-04 12:53:09,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:09,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:09,723 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:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 12:53:10,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:10,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:10,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:10,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:10,585 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-10-04 12:53:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:11,297 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-10-04 12:53:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:11,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-10-04 12:53:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:11,298 INFO L225 Difference]: With dead ends: 530 [2018-10-04 12:53:11,298 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:11,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.0s impTime 3 [2018-10-04 12:53:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:11,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-10-04 12:53:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:11,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:11,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:11,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:11,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:12,050 WARN L178 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 12:53:12,804 WARN L178 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 12:53:13,204 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 12:53:13,507 WARN L178 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 12:53:13,684 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 12:53:13,962 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 12:53:14,887 WARN L178 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 12:53:15,056 INFO L421 ceAbstractionStarter]: At program point L440(lines 440 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,056 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,056 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,057 INFO L421 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4) (= ULTIMATE.start_ssl3_connect_~s__state~3 4432)) [2018-10-04 12:53:15,057 INFO L421 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,057 INFO L421 ceAbstractionStarter]: At program point L296(lines 296 307) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-04 12:53:15,057 INFO L421 ceAbstractionStarter]: At program point L420(lines 420 437) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,057 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,058 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-10-04 12:53:15,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-10-04 12:53:15,058 INFO L421 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,058 INFO L421 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,058 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-10-04 12:53:15,059 INFO L421 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-10-04 12:53:15,059 INFO L421 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,059 INFO L421 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 12:53:15,059 INFO L421 ceAbstractionStarter]: At program point L311(lines 306 330) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-04 12:53:15,059 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-10-04 12:53:15,074 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:15 BoogieIcfgContainer [2018-10-04 12:53:15,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:15,075 INFO L168 Benchmark]: Toolchain (without parser) took 11371.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -38.7 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,077 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:15,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:15,079 INFO L168 Benchmark]: Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:53:15,079 INFO L168 Benchmark]: RCFGBuilder took 706.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,081 INFO L168 Benchmark]: TraceAbstraction took 10536.36 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -70.4 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:15,086 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 706.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10536.36 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 44.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -70.4 MB). Peak memory consumption was 458.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4432 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 10.4s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 71345 SizeOfPredicates, 2 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2279/2289 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-15-106.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-15-106.csv Received shutdown request...