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-m [2018-10-04 14:32:14,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:32:14,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:32:14,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:32:14,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:32:14,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:32:14,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:32:14,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:32:14,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:32:14,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:32:14,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:32:14,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:32:14,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:32:14,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:32:14,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:32:14,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:32:14,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:32:14,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:32:14,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:32:14,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:32:14,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:32:14,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:32:14,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:32:14,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:32:14,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:32:14,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:32:14,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:32:14,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:32:14,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:32:14,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:32:14,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:32:14,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:32:14,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:32:14,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:32:14,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:32:14,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:32:14,991 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 14:32:15,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:32:15,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:32:15,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:32:15,019 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:32:15,020 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:32:15,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:32:15,020 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:32:15,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:32:15,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:32:15,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:32:15,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:32:15,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:32:15,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:32:15,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:32:15,024 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:32:15,024 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:32:15,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:32:15,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:32:15,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:32:15,025 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:32:15,025 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:32:15,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:32:15,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:32:15,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:32:15,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:32:15,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:32:15,027 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:32:15,027 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:32:15,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:32:15,028 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:32:15,029 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:32:15,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:32:15,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:32:15,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:32:15,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:32:15,111 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:32:15,112 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 14:32:15,112 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 14:32:15,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:32:15,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:32:15,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:32:15,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:32:15,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:32:15,220 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,239 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:32:15,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:32:15,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:32:15,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:32:15,269 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,269 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,272 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,273 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,293 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,302 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,305 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 02:32:15" (1/1) ... [2018-10-04 14:32:15,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:32:15,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:32:15,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:32:15,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:32:15,318 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 02:32:15" (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 14:32:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:32:15,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:32:16,089 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:32:16,090 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 02:32:16 BoogieIcfgContainer [2018-10-04 14:32:16,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:32:16,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:32:16,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:32:16,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:32:16,095 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 02:32:15" (1/2) ... [2018-10-04 14:32:16,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f430dfb and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:32:16, skipping insertion in model container [2018-10-04 14:32:16,096 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 02:32:16" (2/2) ... [2018-10-04 14:32:16,098 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-04 14:32:16,107 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:32:16,119 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:32:16,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:32:16,163 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:32:16,163 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:32:16,163 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:32:16,163 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:32:16,164 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:32:16,164 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:32:16,164 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:32:16,164 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:32:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 14:32:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:32:16,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:16,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:16,188 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:16,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-10-04 14:32:16,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:16,372 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 14:32:16,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:16,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:16,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:16,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:16,394 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 14:32:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:16,572 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-10-04 14:32:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:16,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 14:32:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:16,599 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:32:16,599 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:32:16,606 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 14:32:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:32:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:32:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:32:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-10-04 14:32:16,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-10-04 14:32:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:16,640 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-10-04 14:32:16,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-10-04 14:32:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:32:16,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:16,641 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:16,642 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:16,642 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-10-04 14:32:16,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:16,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:16,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:16,722 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 14:32:16,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:16,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:16,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:16,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:16,726 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-10-04 14:32:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:16,890 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-10-04 14:32:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:16,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 14:32:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:16,893 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:32:16,893 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:32:16,894 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 14:32:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:32:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:32:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:32:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-10-04 14:32:16,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-10-04 14:32:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:16,904 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-10-04 14:32:16,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-10-04 14:32:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:32:16,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:16,907 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:16,907 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:16,907 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-10-04 14:32:16,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:17,044 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 14:32:17,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:17,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:17,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:17,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:17,047 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-10-04 14:32:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:17,142 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-10-04 14:32:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:17,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 14:32:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:17,144 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:32:17,145 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:32:17,145 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 14:32:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:32:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:32:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:32:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-10-04 14:32:17,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-10-04 14:32:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:17,153 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-10-04 14:32:17,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-10-04 14:32:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:32:17,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:17,154 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:17,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:17,155 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-10-04 14:32:17,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:17,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:17,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:17,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:17,248 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 14:32:17,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:17,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:17,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:17,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:17,250 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-10-04 14:32:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:17,385 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-10-04 14:32:17,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:17,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 14:32:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:17,387 INFO L225 Difference]: With dead ends: 74 [2018-10-04 14:32:17,387 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 14:32:17,388 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 14:32:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 14:32:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 14:32:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 14:32:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-10-04 14:32:17,398 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-10-04 14:32:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:17,398 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-10-04 14:32:17,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-10-04 14:32:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:32:17,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:17,400 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 14:32:17,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:17,401 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-10-04 14:32:17,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:17,466 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 14:32:17,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:17,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:17,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:17,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:17,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:17,467 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-10-04 14:32:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:17,613 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-10-04 14:32:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:17,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 14:32:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:17,615 INFO L225 Difference]: With dead ends: 92 [2018-10-04 14:32:17,615 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:32:17,616 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 14:32:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:32:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:32:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:32:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-10-04 14:32:17,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-10-04 14:32:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:17,627 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-10-04 14:32:17,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-10-04 14:32:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:32:17,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:17,629 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 14:32:17,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:17,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-10-04 14:32:17,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:17,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:17,738 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 14:32:17,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:17,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:17,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:17,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:17,741 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-10-04 14:32:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:17,860 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-10-04 14:32:17,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:17,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 14:32:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:17,865 INFO L225 Difference]: With dead ends: 71 [2018-10-04 14:32:17,865 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:32:17,865 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 14:32:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:32:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-10-04 14:32:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:32:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-10-04 14:32:17,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-10-04 14:32:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:17,878 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-10-04 14:32:17,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-10-04 14:32:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:32:17,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:17,880 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 14:32:17,880 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:17,881 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-10-04 14:32:17,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:17,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:17,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:17,995 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 14:32:17,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:17,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:17,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:17,996 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-10-04 14:32:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:18,179 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-10-04 14:32:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:18,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 14:32:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:18,182 INFO L225 Difference]: With dead ends: 161 [2018-10-04 14:32:18,182 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 14:32:18,183 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 14:32:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 14:32:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 14:32:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:32:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-10-04 14:32:18,199 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-10-04 14:32:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:18,199 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-10-04 14:32:18,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-10-04 14:32:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 14:32:18,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:18,202 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 14:32:18,202 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:18,202 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-10-04 14:32:18,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:18,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:18,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:18,351 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 14:32:18,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:18,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:18,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:18,356 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-10-04 14:32:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:18,764 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-10-04 14:32:18,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:18,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-04 14:32:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:18,766 INFO L225 Difference]: With dead ends: 205 [2018-10-04 14:32:18,767 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 14:32:18,767 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 14:32:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 14:32:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-10-04 14:32:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-04 14:32:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-10-04 14:32:18,784 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-10-04 14:32:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:18,784 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-10-04 14:32:18,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-10-04 14:32:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 14:32:18,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:18,787 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 14:32:18,787 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:18,787 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-10-04 14:32:18,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:18,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:18,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:18,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:18,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:18,923 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 14:32:18,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:18,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:18,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:18,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:18,925 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-10-04 14:32:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:19,273 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-10-04 14:32:19,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:19,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 14:32:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:19,279 INFO L225 Difference]: With dead ends: 240 [2018-10-04 14:32:19,280 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 14:32:19,281 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 14:32:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 14:32:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 14:32:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 14:32:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-10-04 14:32:19,322 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-10-04 14:32:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:19,323 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-10-04 14:32:19,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-10-04 14:32:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 14:32:19,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:19,328 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 14:32:19,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:19,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-10-04 14:32:19,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:19,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:19,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:19,429 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 14:32:19,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:19,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:19,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:19,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:19,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:19,430 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-10-04 14:32:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:19,597 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-10-04 14:32:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:19,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-04 14:32:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:19,600 INFO L225 Difference]: With dead ends: 297 [2018-10-04 14:32:19,600 INFO L226 Difference]: Without dead ends: 165 [2018-10-04 14:32:19,600 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 14:32:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-04 14:32:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-04 14:32:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 14:32:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-10-04 14:32:19,619 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-10-04 14:32:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:19,619 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-10-04 14:32:19,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-10-04 14:32:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 14:32:19,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:19,621 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 14:32:19,622 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:19,622 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-10-04 14:32:19,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:19,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:19,743 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 14:32:19,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:19,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:19,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:19,744 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:19,744 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-10-04 14:32:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:19,984 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-10-04 14:32:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:19,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-04 14:32:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:19,986 INFO L225 Difference]: With dead ends: 360 [2018-10-04 14:32:19,986 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 14:32:19,987 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 14:32:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 14:32:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-04 14:32:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-04 14:32:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-10-04 14:32:20,012 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-10-04 14:32:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:20,014 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-10-04 14:32:20,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-10-04 14:32:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 14:32:20,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:20,016 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 14:32:20,016 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:20,016 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-10-04 14:32:20,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:20,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:20,161 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 14:32:20,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:20,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:20,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:20,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:20,162 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-10-04 14:32:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:20,697 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-10-04 14:32:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:20,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-10-04 14:32:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:20,699 INFO L225 Difference]: With dead ends: 429 [2018-10-04 14:32:20,699 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 14:32:20,700 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 14:32:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 14:32:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-04 14:32:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-04 14:32:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-10-04 14:32:20,717 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-10-04 14:32:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:20,718 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-10-04 14:32:20,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-10-04 14:32:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 14:32:20,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:20,720 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 14:32:20,720 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:20,720 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-10-04 14:32:20,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:20,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:20,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:20,973 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 14:32:20,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:32:20,973 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 14:32:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:21,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:32:21,746 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 14:32:21,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:32:21,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:32:21,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:32:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:32:21,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:21,782 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-10-04 14:32:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:22,622 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-10-04 14:32:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:32:22,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-10-04 14:32:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:22,623 INFO L225 Difference]: With dead ends: 530 [2018-10-04 14:32:22,623 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:32:22,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime 3 [2018-10-04 14:32:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:32:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:32:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:32:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:32:22,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-10-04 14:32:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:22,626 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:32:22,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:32:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:32:22,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:32:22,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:32:23,366 WARN L178 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 14:32:23,645 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 14:32:23,963 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 14:32:24,265 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 14:32:24,425 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-04 14:32:24,793 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-04 14:32:25,023 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 14:32:25,023 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 14:32:25,023 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 14:32:25,023 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 14:32:25,023 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 14:32:25,023 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 14:32:25,023 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 14:32:25,024 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 14:32:25,024 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 14:32:25,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-10-04 14:32:25,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-10-04 14:32:25,024 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 14:32:25,024 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 14:32:25,024 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 14:32:25,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-10-04 14:32:25,025 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-10-04 14:32:25,025 INFO L421 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-10-04 14:32:25,025 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 14:32:25,025 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 14:32:25,025 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 14:32:25,038 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 02:32:25 BoogieIcfgContainer [2018-10-04 14:32:25,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:32:25,040 INFO L168 Benchmark]: Toolchain (without parser) took 9841.25 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -15.3 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:25,041 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 14:32:25,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.55 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 14:32:25,043 INFO L168 Benchmark]: Boogie Preprocessor took 60.63 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 14:32:25,044 INFO L168 Benchmark]: RCFGBuilder took 773.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:25,045 INFO L168 Benchmark]: TraceAbstraction took 8947.76 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -47.0 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:25,051 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 55.55 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 60.63 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 773.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8947.76 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -47.0 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 8.8s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s 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_14-32-25-068.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_14-32-25-068.csv Received shutdown request...