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_srvr_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:47:39,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:47:39,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:47:39,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:47:39,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:47:39,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:47:39,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:47:39,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:47:39,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:47:39,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:47:39,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:47:39,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:47:39,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:47:39,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:47:39,954 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:47:39,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:47:39,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:47:39,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:47:39,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:47:39,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:47:39,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:47:39,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:47:39,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:47:39,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:47:39,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:47:39,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:47:39,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:47:39,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:47:39,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:47:39,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:47:39,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:47:39,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:47:39,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:47:39,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:47:39,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:47:39,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:47:39,987 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 09:47:40,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:47:40,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:47:40,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:47:40,014 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:47:40,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:47:40,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:47:40,015 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:47:40,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:47:40,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:47:40,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:47:40,018 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:47:40,018 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:47:40,018 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:47:40,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:47:40,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:47:40,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:47:40,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:47:40,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:40,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:47:40,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:47:40,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:47:40,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:47:40,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:47:40,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:47:40,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:47:40,022 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:47:40,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:47:40,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:47:40,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:47:40,096 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:47:40,097 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:47:40,098 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-04 09:47:40,098 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl' [2018-10-04 09:47:40,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:47:40,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:47:40,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:47:40,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:47:40,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:47:40,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:47:40,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:47:40,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:47:40,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:47:40,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (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 09:47:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:47:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:47:41,053 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:47:41,054 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41 BoogieIcfgContainer [2018-10-04 09:47:41,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:47:41,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:47:41,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:47:41,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:47:41,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/2) ... [2018-10-04 09:47:41,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5696a949 and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:47:41, skipping insertion in model container [2018-10-04 09:47:41,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41" (2/2) ... [2018-10-04 09:47:41,062 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-04 09:47:41,072 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:47:41,080 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:47:41,132 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:47:41,133 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:47:41,133 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:47:41,133 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:47:41,133 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:47:41,134 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:47:41,134 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:47:41,134 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:47:41,134 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:47:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 09:47:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:41,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:41,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:41,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:41,166 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-04 09:47:41,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:41,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:41,446 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 09:47:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:41,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:41,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:41,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:41,470 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 09:47:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:41,870 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 09:47:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:41,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:41,886 INFO L225 Difference]: With dead ends: 56 [2018-10-04 09:47:41,886 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:47:41,890 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 09:47:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:47:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:47:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:47:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 09:47:41,934 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 09:47:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:41,934 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 09:47:41,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 09:47:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:47:41,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:41,936 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:41,937 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:41,937 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-04 09:47:41,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:41,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:42,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,045 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,046 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 09:47:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,450 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 09:47:42,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 09:47:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,453 INFO L225 Difference]: With dead ends: 83 [2018-10-04 09:47:42,454 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 09:47:42,456 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 09:47:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 09:47:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 09:47:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 09:47:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 09:47:42,482 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 09:47:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,483 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 09:47:42,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 09:47:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:42,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,486 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:42,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,486 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-04 09:47:42,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 09:47:42,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,608 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 09:47:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,829 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 09:47:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,837 INFO L225 Difference]: With dead ends: 106 [2018-10-04 09:47:42,837 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:47:42,838 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 09:47:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:47:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:47:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:47:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 09:47:42,851 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 09:47:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,852 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 09:47:42,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 09:47:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:42,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,854 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:42,854 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,855 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-04 09:47:42,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:42,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,991 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 09:47:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,279 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 09:47:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,283 INFO L225 Difference]: With dead ends: 131 [2018-10-04 09:47:43,283 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 09:47:43,284 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 09:47:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 09:47:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 09:47:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 09:47:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 09:47:43,305 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 09:47:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,305 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 09:47:43,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 09:47:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:47:43,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,307 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:43,307 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,307 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-04 09:47:43,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 09:47:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,400 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 09:47:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,600 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 09:47:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:47:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,602 INFO L225 Difference]: With dead ends: 153 [2018-10-04 09:47:43,602 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 09:47:43,603 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 09:47:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 09:47:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 09:47:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 09:47:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 09:47:43,618 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 09:47:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,618 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 09:47:43,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 09:47:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:47:43,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,621 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:43,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,621 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-04 09:47:43,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 09:47:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,699 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 09:47:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,864 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 09:47:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 09:47:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,868 INFO L225 Difference]: With dead ends: 164 [2018-10-04 09:47:43,868 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:47:43,869 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 09:47:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:47:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 09:47:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 09:47:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 09:47:43,883 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 09:47:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,884 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 09:47:43,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 09:47:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:47:43,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,887 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:43,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,888 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-04 09:47:43,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,912 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 09:47:43,914 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 09:47:43,915 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 09:47:43,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 09:47:44,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:44,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,225 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 09:47:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,408 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-04 09:47:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:47:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,410 INFO L225 Difference]: With dead ends: 246 [2018-10-04 09:47:44,411 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 09:47:44,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 1 [2018-10-04 09:47:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 09:47:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-04 09:47:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 09:47:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-04 09:47:44,441 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-04 09:47:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,441 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-04 09:47:44,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-04 09:47:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 09:47:44,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,444 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:44,444 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,445 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-04 09:47:44,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-04 09:47:44,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:44,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,530 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-04 09:47:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,954 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-04 09:47:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-04 09:47:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,956 INFO L225 Difference]: With dead ends: 250 [2018-10-04 09:47:44,956 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 09:47:44,957 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 09:47:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 09:47:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 09:47:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 09:47:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-04 09:47:44,999 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-04 09:47:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:45,000 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-04 09:47:45,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-04 09:47:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:47:45,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:45,002 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:45,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:45,003 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-04 09:47:45,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:45,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:47:45,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:45,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:45,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:45,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 09:47:46,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:47:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 09:47:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:47:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:47:46,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:46,337 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-04 09:47:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:47,484 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-04 09:47:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:47:47,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 09:47:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:47,487 INFO L225 Difference]: With dead ends: 598 [2018-10-04 09:47:47,487 INFO L226 Difference]: Without dead ends: 406 [2018-10-04 09:47:47,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.1s impTime 6 [2018-10-04 09:47:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-04 09:47:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-04 09:47:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-04 09:47:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-04 09:47:47,527 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-04 09:47:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:47,527 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-04 09:47:47,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:47:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-04 09:47:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 09:47:47,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:47,530 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:47,530 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:47,530 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-04 09:47:47,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:47,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:47,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:47,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-04 09:47:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:47,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:47,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:47,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:47,624 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-04 09:47:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,065 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-04 09:47:48,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-04 09:47:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,067 INFO L225 Difference]: With dead ends: 399 [2018-10-04 09:47:48,067 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 09:47:48,068 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 09:47:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 09:47:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 09:47:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 09:47:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-04 09:47:48,104 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-04 09:47:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,104 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-04 09:47:48,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-04 09:47:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 09:47:48,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,106 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:48,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,107 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-04 09:47:48,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-04 09:47:48,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:48,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:48,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:48,234 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-04 09:47:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,663 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-04 09:47:48,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 09:47:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,673 INFO L225 Difference]: With dead ends: 470 [2018-10-04 09:47:48,673 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 09:47:48,674 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 09:47:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 09:47:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 09:47:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:47:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-04 09:47:48,713 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-04 09:47:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,713 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-04 09:47:48,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-04 09:47:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 09:47:48,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,715 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:48,715 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,716 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-04 09:47:48,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 09:47:48,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:48,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:48,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:48,815 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-04 09:47:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,963 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-04 09:47:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-04 09:47:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,965 INFO L225 Difference]: With dead ends: 465 [2018-10-04 09:47:48,965 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 09:47:48,966 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 09:47:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 09:47:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 09:47:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 09:47:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-04 09:47:48,996 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-04 09:47:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,996 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-04 09:47:48,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-04 09:47:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 09:47:48,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,998 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:48,998 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,999 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-04 09:47:48,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-04 09:47:49,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,134 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-04 09:47:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,429 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-04 09:47:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:49,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-04 09:47:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,431 INFO L225 Difference]: With dead ends: 465 [2018-10-04 09:47:49,432 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 09:47:49,432 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 09:47:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 09:47:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-04 09:47:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-04 09:47:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-04 09:47:49,465 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-04 09:47:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,465 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-04 09:47:49,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-04 09:47:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 09:47:49,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,467 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,467 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,467 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-04 09:47:49,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-04 09:47:49,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,585 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-04 09:47:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,785 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-04 09:47:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:49,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-04 09:47:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,788 INFO L225 Difference]: With dead ends: 498 [2018-10-04 09:47:49,789 INFO L226 Difference]: Without dead ends: 268 [2018-10-04 09:47:49,789 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 09:47:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-04 09:47:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-04 09:47:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 09:47:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-04 09:47:49,819 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-04 09:47:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,820 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-04 09:47:49,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-04 09:47:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 09:47:49,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,821 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,821 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,822 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-04 09:47:49,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-04 09:47:49,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,941 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-04 09:47:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,133 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-04 09:47:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:50,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-04 09:47:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,136 INFO L225 Difference]: With dead ends: 561 [2018-10-04 09:47:50,136 INFO L226 Difference]: Without dead ends: 301 [2018-10-04 09:47:50,136 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 09:47:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-04 09:47:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-04 09:47:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 09:47:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-04 09:47:50,171 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-04 09:47:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,172 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-04 09:47:50,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-04 09:47:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 09:47:50,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,174 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:50,174 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,174 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-04 09:47:50,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-04 09:47:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:50,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:50,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,287 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-04 09:47:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,550 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-04 09:47:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:50,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 09:47:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,553 INFO L225 Difference]: With dead ends: 397 [2018-10-04 09:47:50,553 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 09:47:50,553 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 09:47:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 09:47:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 09:47:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 09:47:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-04 09:47:50,595 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-04 09:47:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,596 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-04 09:47:50,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-04 09:47:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 09:47:50,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,598 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:50,598 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,598 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-04 09:47:50,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:50,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,615 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 09:47:50,615 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 09:47:50,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 09:47:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-10-04 09:47:50,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:50,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:50,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:50,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,929 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-04 09:47:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:51,043 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-04 09:47:51,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:51,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-04 09:47:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:51,046 INFO L225 Difference]: With dead ends: 782 [2018-10-04 09:47:51,046 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 09:47:51,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 1 [2018-10-04 09:47:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 09:47:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 09:47:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 09:47:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-04 09:47:51,085 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-04 09:47:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:51,086 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-04 09:47:51,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-04 09:47:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 09:47:51,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:51,088 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:51,088 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:51,089 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-04 09:47:51,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 09:47:51,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:51,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:51,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 09:47:51,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:47:51,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:51,562 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:51,562 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-04 09:47:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:52,042 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-04 09:47:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:47:52,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 09:47:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:52,043 INFO L225 Difference]: With dead ends: 629 [2018-10-04 09:47:52,043 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:52,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 09:47:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:52,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 09:47:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:52,046 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:52,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:52,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:52,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:52,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:52,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,966 WARN L178 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-04 09:47:55,003 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:55,689 WARN L178 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-04 09:47:55,812 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-04 09:47:56,470 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:56,723 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:56,855 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:56,980 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:57,095 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-04 09:47:57,098 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 386) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:57,099 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,099 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 436) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-10-04 09:47:57,099 INFO L421 ceAbstractionStarter]: At program point L478(lines 263 478) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,099 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-10-04 09:47:57,099 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-10-04 09:47:57,099 INFO L421 ceAbstractionStarter]: At program point L412(lines 412 423) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:57,099 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 413) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L272(lines 235 272) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L268(lines 268 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L458(lines 455 473) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L425(lines 422 444) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L322(lines 322 339) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-04 09:47:57,100 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L248(lines 248 264) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,100 INFO L421 ceAbstractionStarter]: At program point L389(lines 389 401) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L290(lines 290 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L443(lines 443 469) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L344(lines 344 352) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 456) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:57,101 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 319) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-04 09:47:57,101 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-10-04 09:47:57,119 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:57 BoogieIcfgContainer [2018-10-04 09:47:57,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:57,120 INFO L168 Benchmark]: Toolchain (without parser) took 16939.14 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 46.1 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:57,122 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 09:47:57,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.09 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 09:47:57,123 INFO L168 Benchmark]: Boogie Preprocessor took 36.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:57,123 INFO L168 Benchmark]: RCFGBuilder took 788.15 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 09:47:57,124 INFO L168 Benchmark]: TraceAbstraction took 16064.52 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.4 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:57,129 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.20 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 46.09 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 36.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 788.15 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 16064.52 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.4 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 480]: 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: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 15.9s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2046 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 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_srvr_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-57-147.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-57-147.csv Received shutdown request...