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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:49:15,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:49:15,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:49:15,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:49:15,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:49:15,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:49:15,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:49:15,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:49:15,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:49:15,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:49:15,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:49:15,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:49:15,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:49:15,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:49:15,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:49:15,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:49:15,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:49:15,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:49:15,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:49:15,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:49:15,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:49:15,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:49:15,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:49:15,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:49:15,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:49:15,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:49:15,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:49:15,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:49:15,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:49:15,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:49:15,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:49:15,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:49:15,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:49:15,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:49:15,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:49:15,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:49:15,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:49:15,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:49:15,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:49:15,787 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:49:15,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:49:15,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:49:15,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:49:15,789 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:49:15,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:49:15,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:49:15,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:49:15,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:49:15,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:49:15,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:49:15,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:49:15,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:49:15,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:49:15,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:49:15,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:49:15,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:49:15,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:49:15,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:49:15,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:49:15,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:15,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:49:15,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:49:15,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:49:15,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:49:15,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:49:15,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:49:15,796 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:49:15,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:49:15,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:49:15,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:49:15,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:49:15,892 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:49:15,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-10-02 11:49:15,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-10-02 11:49:15,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:49:16,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:49:16,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:16,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:49:16,005 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:49:16,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:16,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:49:16,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:49:16,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:49:16,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... [2018-10-02 11:49:16,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:49:16,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:49:16,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:49:16,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:49:16,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:16,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:49:16,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:49:16,915 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:49:16,915 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:16 BoogieIcfgContainer [2018-10-02 11:49:16,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:49:16,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:49:16,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:49:16,922 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:49:16,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:49:15" (1/2) ... [2018-10-02 11:49:16,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3406704 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:49:16, skipping insertion in model container [2018-10-02 11:49:16,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:49:16" (2/2) ... [2018-10-02 11:49:16,926 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-10-02 11:49:16,936 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:49:16,946 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:49:17,000 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:49:17,001 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:49:17,001 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:49:17,001 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:49:17,001 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:49:17,001 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:49:17,002 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:49:17,002 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:49:17,002 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:49:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-02 11:49:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:49:17,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:17,026 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:17,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:17,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-10-02 11:49:17,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:17,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:17,279 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-02 11:49:17,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:17,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:17,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:17,302 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-02 11:49:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:17,750 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-02 11:49:17,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:17,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 11:49:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:17,771 INFO L225 Difference]: With dead ends: 56 [2018-10-02 11:49:17,771 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 11:49:17,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 11:49:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 11:49:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 11:49:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-02 11:49:17,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-02 11:49:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:17,819 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-02 11:49:17,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-02 11:49:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:49:17,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:17,821 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:17,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:17,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-10-02 11:49:17,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:17,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:17,959 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-02 11:49:17,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:17,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:17,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:17,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:17,963 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-02 11:49:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:18,167 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-02 11:49:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:18,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-02 11:49:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:18,170 INFO L225 Difference]: With dead ends: 83 [2018-10-02 11:49:18,170 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 11:49:18,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 11:49:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 11:49:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 11:49:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-02 11:49:18,185 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-02 11:49:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:18,185 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-02 11:49:18,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-02 11:49:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:49:18,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:18,187 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-02 11:49:18,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:18,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-10-02 11:49:18,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:18,283 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-02 11:49:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,286 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-02 11:49:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:18,508 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-02 11:49:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:18,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:49:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:18,510 INFO L225 Difference]: With dead ends: 106 [2018-10-02 11:49:18,510 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 11:49:18,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 11:49:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 11:49:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:49:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-02 11:49:18,524 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-02 11:49:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:18,525 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-02 11:49:18,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-02 11:49:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:49:18,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:18,527 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-02 11:49:18,527 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:18,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-10-02 11:49:18,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:18,598 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-02 11:49:18,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:18,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:18,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,601 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-02 11:49:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:18,846 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-02 11:49:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:18,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:49:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:18,848 INFO L225 Difference]: With dead ends: 131 [2018-10-02 11:49:18,848 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 11:49:18,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 11:49:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-02 11:49:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-02 11:49:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-02 11:49:18,863 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-02 11:49:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-02 11:49:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-02 11:49:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:49:18,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:18,866 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-02 11:49:18,866 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:18,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-10-02 11:49:18,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:18,972 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-02 11:49:18,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:18,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:18,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:18,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,975 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-02 11:49:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:19,374 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-02 11:49:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:19,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-02 11:49:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:19,378 INFO L225 Difference]: With dead ends: 153 [2018-10-02 11:49:19,379 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 11:49:19,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 11:49:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-02 11:49:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-02 11:49:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-02 11:49:19,409 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-02 11:49:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:19,409 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-02 11:49:19,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-02 11:49:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 11:49:19,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:19,411 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-02 11:49:19,412 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:19,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-10-02 11:49:19,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:19,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:19,531 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-02 11:49:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,533 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-02 11:49:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:19,718 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-02 11:49:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:19,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 11:49:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:19,725 INFO L225 Difference]: With dead ends: 164 [2018-10-02 11:49:19,725 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 11:49:19,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 11:49:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 11:49:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 11:49:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-02 11:49:19,751 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-02 11:49:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:19,753 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-02 11:49:19,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-02 11:49:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:49:19,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:19,758 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-02 11:49:19,758 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-10-02 11:49:19,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:19,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:19,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:19,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:19,879 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-02 11:49:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:19,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,882 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-02 11:49:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:20,223 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-10-02 11:49:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:20,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 11:49:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:20,225 INFO L225 Difference]: With dead ends: 181 [2018-10-02 11:49:20,226 INFO L226 Difference]: Without dead ends: 96 [2018-10-02 11:49:20,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-02 11:49:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-02 11:49:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-02 11:49:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-10-02 11:49:20,259 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-10-02 11:49:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:20,262 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-10-02 11:49:20,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-10-02 11:49:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 11:49:20,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:20,266 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:20,266 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:20,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-10-02 11:49:20,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-02 11:49:20,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:20,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:20,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:20,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:20,368 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-10-02 11:49:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:20,606 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-10-02 11:49:20,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:20,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-02 11:49:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:20,608 INFO L225 Difference]: With dead ends: 195 [2018-10-02 11:49:20,608 INFO L226 Difference]: Without dead ends: 100 [2018-10-02 11:49:20,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-02 11:49:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-02 11:49:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-02 11:49:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-10-02 11:49:20,644 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-10-02 11:49:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:20,645 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-10-02 11:49:20,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-10-02 11:49:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 11:49:20,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:20,652 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-02 11:49:20,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:20,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-10-02 11:49:20,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:20,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:20,848 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-02 11:49:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:20,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:20,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:20,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:21,114 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-02 11:49:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 11:49:21,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:49:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:49:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:21,153 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-10-02 11:49:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:22,854 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-10-02 11:49:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:49:22,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-02 11:49:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:22,857 INFO L225 Difference]: With dead ends: 441 [2018-10-02 11:49:22,857 INFO L226 Difference]: Without dead ends: 328 [2018-10-02 11:49:22,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:49:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-02 11:49:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-10-02 11:49:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-02 11:49:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-10-02 11:49:22,896 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-10-02 11:49:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:22,896 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-10-02 11:49:22,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:49:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-10-02 11:49:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-02 11:49:22,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:22,898 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:22,899 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:22,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-10-02 11:49:22,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:22,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:22,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:22,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-02 11:49:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:22,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:22,964 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-10-02 11:49:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:23,235 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-10-02 11:49:23,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:23,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-02 11:49:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:23,237 INFO L225 Difference]: With dead ends: 374 [2018-10-02 11:49:23,237 INFO L226 Difference]: Without dead ends: 182 [2018-10-02 11:49:23,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-02 11:49:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-02 11:49:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-02 11:49:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-02 11:49:23,271 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-10-02 11:49:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:23,271 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-02 11:49:23,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-02 11:49:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-02 11:49:23,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:23,273 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:23,273 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:23,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-10-02 11:49:23,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:23,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-02 11:49:23,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:23,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:23,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:23,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:23,414 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-10-02 11:49:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:23,729 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-10-02 11:49:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:23,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-02 11:49:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:23,737 INFO L225 Difference]: With dead ends: 381 [2018-10-02 11:49:23,737 INFO L226 Difference]: Without dead ends: 202 [2018-10-02 11:49:23,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-02 11:49:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-02 11:49:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-02 11:49:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-10-02 11:49:23,779 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-10-02 11:49:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:23,780 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-10-02 11:49:23,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-10-02 11:49:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-02 11:49:23,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:23,781 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-02 11:49:23,782 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:23,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-10-02 11:49:23,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:23,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:23,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:23,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:23,917 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-02 11:49:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:23,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:23,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:23,919 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-10-02 11:49:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:24,110 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-10-02 11:49:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:24,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-02 11:49:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:24,113 INFO L225 Difference]: With dead ends: 298 [2018-10-02 11:49:24,113 INFO L226 Difference]: Without dead ends: 296 [2018-10-02 11:49:24,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-02 11:49:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-02 11:49:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-02 11:49:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-10-02 11:49:24,159 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-10-02 11:49:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:24,160 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-10-02 11:49:24,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-10-02 11:49:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-02 11:49:24,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:24,164 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:24,164 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:24,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-10-02 11:49:24,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-02 11:49:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,353 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-10-02 11:49:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:24,668 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-10-02 11:49:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:24,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-02 11:49:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:24,672 INFO L225 Difference]: With dead ends: 589 [2018-10-02 11:49:24,672 INFO L226 Difference]: Without dead ends: 296 [2018-10-02 11:49:24,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-02 11:49:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-02 11:49:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-02 11:49:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-10-02 11:49:24,715 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-10-02 11:49:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:24,716 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-10-02 11:49:24,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-10-02 11:49:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-02 11:49:24,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:24,718 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-02 11:49:24,718 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:24,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-10-02 11:49:24,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:24,930 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-02 11:49:24,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:24,930 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-02 11:49:24,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:25,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:25,116 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-02 11:49:25,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:49:25,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:49:25,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:25,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:25,158 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-10-02 11:49:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:25,851 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-10-02 11:49:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:49:25,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-02 11:49:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:25,854 INFO L225 Difference]: With dead ends: 470 [2018-10-02 11:49:25,854 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:25,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:25,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-02 11:49:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:25,856 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:25,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:25,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:25,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:25,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:25,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:26,565 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-02 11:49:28,369 WARN L178 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-02 11:49:29,034 WARN L178 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-02 11:49:29,209 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-10-02 11:49:29,434 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-02 11:49:29,653 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-02 11:49:29,873 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-02 11:49:30,087 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-02 11:49:30,247 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-02 11:49:30,479 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-10-02 11:49:30,701 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-02 11:49:30,909 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-10-02 11:49:31,021 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-02 11:49:31,107 INFO L421 ceAbstractionStarter]: At program point L415(lines 415 427) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-02 11:49:31,107 INFO L421 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-02 11:49:31,107 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 378) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse5 .cse6) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse9 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse8 .cse5 .cse6))) [2018-10-02 11:49:31,107 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,108 INFO L421 ceAbstractionStarter]: At program point L461(lines 461 482) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-02 11:49:31,108 INFO L421 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-10-02 11:49:31,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:31,108 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:31,108 INFO L421 ceAbstractionStarter]: At program point L313(lines 313 324) the Hoare annotation is: (let ((.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse3 .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L400(lines 400 412) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-02 11:49:31,109 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L380(lines 380 397) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 365) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse7 .cse2 .cse9 .cse5))) [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L442(lines 442 462) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L504(lines 286 504) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,109 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 449) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-02 11:49:31,110 INFO L421 ceAbstractionStarter]: At program point L430(lines 430 439) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3) (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,110 INFO L421 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse4 .cse2 .cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-02 11:49:31,110 INFO L421 ceAbstractionStarter]: At program point L484(lines 481 499) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-02 11:49:31,110 INFO L421 ceAbstractionStarter]: At program point L451(lines 448 470) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-02 11:49:31,110 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) no Hoare annotation was computed. [2018-10-02 11:49:31,110 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,111 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-02 11:49:31,129 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:31 BoogieIcfgContainer [2018-10-02 11:49:31,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:31,130 INFO L168 Benchmark]: Toolchain (without parser) took 15130.30 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 114.8 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -88.3 MB). Peak memory consumption was 591.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:31,132 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:31,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.42 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-02 11:49:31,133 INFO L168 Benchmark]: Boogie Preprocessor took 66.32 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-02 11:49:31,133 INFO L168 Benchmark]: RCFGBuilder took 782.40 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-02 11:49:31,134 INFO L168 Benchmark]: TraceAbstraction took 14211.09 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 114.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -120.0 MB). Peak memory consumption was 559.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:31,138 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.42 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 66.32 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 782.40 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 14211.09 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 114.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -120.0 MB). Peak memory consumption was 559.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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: 271]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 5.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 220 NumberOfFragments, 1025 HoareAnnotationTreeSize, 19 FomulaSimplifications, 8878 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3305 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1200 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 4505/4529 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.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-49-31-157.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-49-31-157.csv Received shutdown request...