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-1cc990c [2018-10-01 00:56:19,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:56:19,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:56:19,519 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:56:19,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:56:19,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:56:19,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:56:19,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:56:19,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:56:19,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:56:19,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:56:19,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:56:19,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:56:19,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:56:19,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:56:19,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:56:19,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:56:19,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:56:19,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:56:19,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:56:19,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:56:19,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:56:19,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:56:19,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:56:19,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:56:19,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:56:19,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:56:19,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:56:19,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:56:19,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:56:19,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:56:19,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:56:19,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:56:19,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:56:19,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:56:19,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:56:19,572 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-01 00:56:19,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:56:19,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:56:19,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:56:19,597 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:56:19,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:56:19,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:56:19,601 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:56:19,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:56:19,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:56:19,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:56:19,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:56:19,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:56:19,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:56:19,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:56:19,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:56:19,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:56:19,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:56:19,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:19,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:56:19,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:56:19,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:56:19,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:56:19,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:56:19,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:56:19,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:56:19,607 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:56:19,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:56:19,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:56:19,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:56:19,672 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:56:19,673 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:56:19,673 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-01 00:56:19,674 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-01 00:56:19,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:56:19,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:56:19,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:19,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:56:19,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:56:19,783 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,799 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:19,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:56:19,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:56:19,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:56:19,820 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,820 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,830 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,831 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,849 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,855 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,862 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 01.10 12:56:19" (1/1) ... [2018-10-01 00:56:19,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:56:19,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:56:19,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:56:19,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:56:19,870 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 01.10 12:56:19" (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-01 00:56:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:56:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:56:20,601 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:56:20,601 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:20 BoogieIcfgContainer [2018-10-01 00:56:20,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:56:20,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:56:20,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:56:20,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:56:20,606 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 01.10 12:56:19" (1/2) ... [2018-10-01 00:56:20,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d8eb1e and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:56:20, skipping insertion in model container [2018-10-01 00:56:20,607 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 01.10 12:56:20" (2/2) ... [2018-10-01 00:56:20,609 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-01 00:56:20,618 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:56:20,627 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:56:20,676 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:56:20,677 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:56:20,677 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:56:20,677 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:56:20,677 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:56:20,677 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:56:20,677 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:56:20,678 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:56:20,678 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:56:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-01 00:56:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:56:20,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:20,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:20,702 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:20,712 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-01 00:56:20,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:20,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:20,961 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-01 00:56:20,964 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:20,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:20,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:20,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:20,982 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-01 00:56:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:21,860 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-01 00:56:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:21,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:56:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:21,875 INFO L225 Difference]: With dead ends: 56 [2018-10-01 00:56:21,875 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:56:21,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:56:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-01 00:56:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-01 00:56:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-01 00:56:21,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-01 00:56:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:21,916 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-01 00:56:21,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-01 00:56:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 00:56:21,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:21,917 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:21,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:21,918 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-01 00:56:21,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:21,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:21,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:22,022 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-01 00:56:22,024 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:22,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:22,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:22,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:22,027 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-01 00:56:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:22,536 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-01 00:56:22,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:22,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-01 00:56:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:22,538 INFO L225 Difference]: With dead ends: 83 [2018-10-01 00:56:22,539 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 00:56:22,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 00:56:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-01 00:56:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-01 00:56:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-01 00:56:22,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-01 00:56:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:22,555 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-01 00:56:22,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-01 00:56:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:56:22,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:22,556 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-01 00:56:22,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:22,557 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-01 00:56:22,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:22,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:22,647 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-01 00:56:22,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:22,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:22,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:22,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:22,649 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-01 00:56:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:23,243 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-01 00:56:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:23,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-01 00:56:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:23,246 INFO L225 Difference]: With dead ends: 106 [2018-10-01 00:56:23,246 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:56:23,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:56:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:56:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:56:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-01 00:56:23,261 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-01 00:56:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:23,262 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-01 00:56:23,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-01 00:56:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:56:23,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:23,263 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-01 00:56:23,264 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:23,264 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-01 00:56:23,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:23,384 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-01 00:56:23,385 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:23,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:23,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:23,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:23,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:23,386 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-01 00:56:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:23,763 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-01 00:56:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:23,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-01 00:56:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:23,765 INFO L225 Difference]: With dead ends: 131 [2018-10-01 00:56:23,765 INFO L226 Difference]: Without dead ends: 74 [2018-10-01 00:56:23,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-01 00:56:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-01 00:56:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-01 00:56:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-01 00:56:23,782 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-01 00:56:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:23,782 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-01 00:56:23,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-01 00:56:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:56:23,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:23,784 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-01 00:56:23,785 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:23,785 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-01 00:56:23,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:23,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:23,868 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-01 00:56:23,868 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:23,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:23,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:23,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:23,870 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-01 00:56:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:24,061 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-01 00:56:24,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:24,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-01 00:56:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:24,063 INFO L225 Difference]: With dead ends: 153 [2018-10-01 00:56:24,063 INFO L226 Difference]: Without dead ends: 80 [2018-10-01 00:56:24,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-01 00:56:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-01 00:56:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-01 00:56:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-01 00:56:24,083 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-01 00:56:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:24,083 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-01 00:56:24,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-01 00:56:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:56:24,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:24,085 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-01 00:56:24,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:24,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-01 00:56:24,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:24,185 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-01 00:56:24,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:24,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:24,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:24,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:24,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:24,187 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-01 00:56:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:24,376 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-01 00:56:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:24,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-01 00:56:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:24,378 INFO L225 Difference]: With dead ends: 164 [2018-10-01 00:56:24,378 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:56:24,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:56:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 00:56:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:56:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-01 00:56:24,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-01 00:56:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:24,394 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-01 00:56:24,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-01 00:56:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:56:24,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:24,396 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-01 00:56:24,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:24,397 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-01 00:56:24,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:24,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:24,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:24,410 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-01 00:56:24,410 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-10-01 00:56:24,411 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-01 00:56:24,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:24,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:24,817 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-01 00:56:24,848 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:24,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:24,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:24,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:24,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:24,849 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-01 00:56:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:25,460 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-01 00:56:25,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:25,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-01 00:56:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:25,463 INFO L225 Difference]: With dead ends: 246 [2018-10-01 00:56:25,463 INFO L226 Difference]: Without dead ends: 162 [2018-10-01 00:56:25,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:56:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-01 00:56:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-01 00:56:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-01 00:56:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-01 00:56:25,491 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-01 00:56:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-01 00:56:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-01 00:56:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-01 00:56:25,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:25,494 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-01 00:56:25,494 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:25,494 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-01 00:56:25,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:25,612 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-01 00:56:25,613 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:25,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:25,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:25,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:25,614 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-01 00:56:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:26,199 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-01 00:56:26,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:26,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-01 00:56:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:26,201 INFO L225 Difference]: With dead ends: 250 [2018-10-01 00:56:26,202 INFO L226 Difference]: Without dead ends: 166 [2018-10-01 00:56:26,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-01 00:56:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-01 00:56:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-01 00:56:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-01 00:56:26,239 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-01 00:56:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:26,240 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-01 00:56:26,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-01 00:56:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:56:26,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:26,242 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-01 00:56:26,243 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:26,243 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-01 00:56:26,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:26,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:26,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:26,337 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-01 00:56:26,337 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:26,337 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-01 00:56:26,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:26,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:26,720 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-01 00:56:26,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:56:26,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-01 00:56:26,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:56:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:56:26,742 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:26,742 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-01 00:56:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:29,067 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-01 00:56:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:56:29,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-01 00:56:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:29,070 INFO L225 Difference]: With dead ends: 598 [2018-10-01 00:56:29,070 INFO L226 Difference]: Without dead ends: 406 [2018-10-01 00:56:29,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:56:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-01 00:56:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-01 00:56:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-01 00:56:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-01 00:56:29,104 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-01 00:56:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:29,104 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-01 00:56:29,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:56:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-01 00:56:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:56:29,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:29,107 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-01 00:56:29,107 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:29,107 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-01 00:56:29,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:29,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:29,204 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-01 00:56:29,204 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:29,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:29,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:29,205 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-01 00:56:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:29,771 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-01 00:56:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:29,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-01 00:56:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:29,775 INFO L225 Difference]: With dead ends: 399 [2018-10-01 00:56:29,775 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:56:29,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:56:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-01 00:56:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-01 00:56:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-01 00:56:29,802 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-01 00:56:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:29,803 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-01 00:56:29,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-01 00:56:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 00:56:29,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:29,804 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-01 00:56:29,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:29,805 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-01 00:56:29,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:29,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:29,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:29,901 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-01 00:56:29,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:29,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:29,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:29,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:29,902 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-01 00:56:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:30,077 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-01 00:56:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:30,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-01 00:56:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:30,079 INFO L225 Difference]: With dead ends: 470 [2018-10-01 00:56:30,079 INFO L226 Difference]: Without dead ends: 237 [2018-10-01 00:56:30,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-01 00:56:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-01 00:56:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-01 00:56:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-01 00:56:30,106 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-01 00:56:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:30,107 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-01 00:56:30,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-01 00:56:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-01 00:56:30,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:30,108 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-01 00:56:30,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:30,109 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-01 00:56:30,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:30,181 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-01 00:56:30,181 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:30,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:30,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:30,182 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-01 00:56:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:30,459 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-01 00:56:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:30,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-01 00:56:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:30,463 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:56:30,463 INFO L226 Difference]: Without dead ends: 235 [2018-10-01 00:56:30,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-01 00:56:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-01 00:56:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-01 00:56:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-01 00:56:30,490 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-01 00:56:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:30,490 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-01 00:56:30,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-01 00:56:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:56:30,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:30,491 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-01 00:56:30,492 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:30,492 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-01 00:56:30,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:30,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:30,557 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-01 00:56:30,557 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:30,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:30,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:30,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:30,558 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-01 00:56:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:30,808 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-01 00:56:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:30,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-01 00:56:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:30,811 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:56:30,811 INFO L226 Difference]: Without dead ends: 238 [2018-10-01 00:56:30,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-01 00:56:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-01 00:56:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-01 00:56:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-01 00:56:30,837 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-01 00:56:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:30,838 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-01 00:56:30,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-01 00:56:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:56:30,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:30,839 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-01 00:56:30,839 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:30,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-01 00:56:30,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:30,947 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-01 00:56:30,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:30,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:30,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:30,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:30,948 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-01 00:56:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:32,106 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-01 00:56:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:32,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-01 00:56:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:32,108 INFO L225 Difference]: With dead ends: 498 [2018-10-01 00:56:32,108 INFO L226 Difference]: Without dead ends: 268 [2018-10-01 00:56:32,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-01 00:56:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-01 00:56:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-01 00:56:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-01 00:56:32,134 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-01 00:56:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:32,134 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-01 00:56:32,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-01 00:56:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:56:32,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:32,135 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-01 00:56:32,136 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:32,136 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-01 00:56:32,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:32,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:32,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:32,262 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-01 00:56:32,263 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:32,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:32,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:32,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:32,264 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:32,264 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-01 00:56:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:32,624 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-01 00:56:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:32,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-01 00:56:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:32,626 INFO L225 Difference]: With dead ends: 561 [2018-10-01 00:56:32,627 INFO L226 Difference]: Without dead ends: 301 [2018-10-01 00:56:32,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-01 00:56:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-01 00:56:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-01 00:56:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-01 00:56:32,669 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-01 00:56:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:32,669 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-01 00:56:32,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-01 00:56:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-01 00:56:32,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:32,671 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-01 00:56:32,671 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:32,673 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-01 00:56:32,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:32,808 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-01 00:56:32,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:32,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:32,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:32,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:32,812 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-01 00:56:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:33,436 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-01 00:56:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:33,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-01 00:56:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:33,439 INFO L225 Difference]: With dead ends: 397 [2018-10-01 00:56:33,439 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:56:33,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:56:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-01 00:56:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-01 00:56:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-01 00:56:33,484 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-01 00:56:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:33,484 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-01 00:56:33,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-01 00:56:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:56:33,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:33,486 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-01 00:56:33,487 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:33,487 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-01 00:56:33,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:33,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:33,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:33,505 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-01 00:56:33,505 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-10-01 00:56:33,505 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-01 00:56:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:33,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:34,078 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-01 00:56:34,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:34,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:34,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:34,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:34,112 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-01 00:56:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:34,455 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-01 00:56:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:34,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-01 00:56:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:34,457 INFO L225 Difference]: With dead ends: 782 [2018-10-01 00:56:34,458 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:56:34,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:56:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:56:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-01 00:56:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-01 00:56:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-01 00:56:34,510 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-01 00:56:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:34,510 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-01 00:56:34,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-01 00:56:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 00:56:34,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:34,513 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-01 00:56:34,514 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:34,514 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-01 00:56:34,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:34,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:34,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:34,791 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-01 00:56:34,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:34,791 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-01 00:56:34,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:34,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:35,029 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-01 00:56:35,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:56:35,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:56:35,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:56:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:56:35,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:35,053 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-01 00:56:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:35,236 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-01 00:56:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:56:35,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-01 00:56:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:35,237 INFO L225 Difference]: With dead ends: 629 [2018-10-01 00:56:35,237 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:56:35,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:56:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:56:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:56:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:56:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:56:35,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-01 00:56:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:35,239 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:56:35,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:56:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:56:35,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:56:35,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:56:35,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:35,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:36,495 WARN L178 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-01 00:56:36,918 WARN L178 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-01 00:56:37,132 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-01 00:56:37,248 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-01 00:56:37,435 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-01 00:56:37,684 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-01 00:56:38,012 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-01 00:56:38,136 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-01 00:56:38,547 WARN L178 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-01 00:56:38,674 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-01 00:56:38,791 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-01 00:56:38,877 INFO L422 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-01 00:56:38,877 INFO L422 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-01 00:56:38,878 INFO L422 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-01 00:56:38,878 INFO L422 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-01 00:56:38,878 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-10-01 00:56:38,878 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-10-01 00:56:38,878 INFO L422 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-01 00:56:38,878 INFO L422 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-01 00:56:38,879 INFO L422 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-01 00:56:38,879 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-10-01 00:56:38,879 INFO L422 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-01 00:56:38,879 INFO L422 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-01 00:56:38,879 INFO L422 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-01 00:56:38,879 INFO L422 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-01 00:56:38,879 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-10-01 00:56:38,879 INFO L422 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-01 00:56:38,880 INFO L422 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-01 00:56:38,880 INFO L422 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-01 00:56:38,880 INFO L422 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-01 00:56:38,880 INFO L422 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-01 00:56:38,880 INFO L422 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-10-01 00:56:38,880 INFO L422 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-01 00:56:38,880 INFO L422 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-01 00:56:38,897 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:56:38 BoogieIcfgContainer [2018-10-01 00:56:38,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:56:38,898 INFO L168 Benchmark]: Toolchain (without parser) took 19137.34 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 138.4 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 265.7 MB). Peak memory consumption was 404.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:38,899 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-01 00:56:38,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.46 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-01 00:56:38,900 INFO L168 Benchmark]: Boogie Preprocessor took 60.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:56:38,901 INFO L168 Benchmark]: RCFGBuilder took 732.44 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-01 00:56:38,902 INFO L168 Benchmark]: TraceAbstraction took 18294.67 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 138.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 234.0 MB). Peak memory consumption was 372.4 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:38,906 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.24 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 44.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 732.44 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 18294.67 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 138.4 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 234.0 MB). Peak memory consumption was 372.4 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, 18.2s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s 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.4s 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, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s 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-01_00-56-38-927.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-01_00-56-38-927.csv Received shutdown request...